Results 261 to 270 of about 97,467 (324)

A category theory perspective on the Language of Thought: LoT is universal. [PDF]

Front Psychol
Phillips S.
europepmc   +1 more source

Correspondence Analysis for Some Fragments of Classical Propositional Logic

Logica Universalis, 2021
In the paper, we apply Kooi and Tamminga’s correspondence analysis (that has been previously applied to some notable three- and four-valued logics) to some conventional and functionally incomplete fragments of classical propositional logic. In particular, the paper deals with the implication, disjunction, and negation fragments.
Petrukhin, Yaroslav, Shangin, Vasilyi
semanticscholar   +4 more sources

PEIRCE’S CALCULI FOR CLASSICAL PROPOSITIONAL LOGIC

The Review of Symbolic Logic, 2018
AbstractThis article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted byPC, is here presented as a sequent calculus and not as a natural deduction system.
Ma, Minghui, Pietarinen, Ahti-Veikko
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Tableau Methods for Classical Propositional Logic

1999
Traditionally, a mathematical problem was considered ‘closed’ when an algorithm was found to solve it ‘in principle’. In this sense the deducibility problem of classical propositional logic was already ‘closed’ in the early 1920’s, when Wittgenstein and Post independently devised the well-known decision procedure based on the truth-tables.
Marcello D'Agostino
openaire   +3 more sources

Classical Propositional Logic - PC -

1990
In this chapter I will present the classical propositional logic which, I believe, is the simplest logic that can be developed from the assumptions of Chapter I. In this setting I present the notions of a formal language, a model, the logical form of a proposition, proof, consequence, and the notion of a logic.
R. L. Epstein
openaire   +2 more sources

Complexity of Proofs in Classical Propositional Logic

1992
This paper surveys the work of the last two decades on the complexity of proofs in classical propositional logic, and its connection with open problems in theoretical computer science. The paper ends with a short list of open problems.
A. Urquhart
openaire   +2 more sources

Substitutional Definition of Satisfiability in Classical Propositional Logic

International Conference on Theory and Applications of Satisfiability Testing, 2005
The syntactic framework of the so-called saturated substitutions is defined and used to obtain new characterizations of SAT as well as the classes of minimal and maximal models of formulas of classical propositional logic.
Anton Belov, Zbigniew Stachniak
openaire   +2 more sources

Quantum logic and the classical propositional calculus

The Journal of Symbolic Logic, 1987
AbstractIn much the same way that it is possible to construct a model of hyperbolic geometry in the Euclidean plane, it is possible to model quantum logic within the classical propositional calculus.
O. Malhas
openaire   +2 more sources

Classical Propositional Logic

1997
Jean Goubault-Larrecq, Ian Mackie
openaire   +2 more sources

CLASSICAL PROPOSITIONAL LOGIC

1998
Lu Zhongwan
openaire   +2 more sources