Results 241 to 250 of about 44,803 (280)

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.
openaire   +1 more source

Classical Gentzen-type Methods in Propositional Many-valued Logics

Proceedings 31st IEEE International Symposium on Multiple-Valued Logic, 2002
A classical Gentzen-type system is one which employs two-sided sequents, together with structural and logical rules of a certain characteristic form. A decent Gentzen-type system should allow for direct proofs, which means that it should admit some useful forms of cut elimination and the subformula property.
openaire   +1 more source

A Classical Propositional Logic for Reasoning About Reversible Logic Circuits

2016
We propose a syntactic representation of reversible logic circuits in their entirety, based on Feynman's control interpretation of Toffoli's reversible gate set. A pair of interacting proof calculi for reasoning about these circuits is presented, based on classical propositional logic and monoidal structure, and a natural order-theoretic structure is ...
Axelsen, Holger Bock, Glück, Robert, Kaarsgaard, Robin   +2 more
openaire   +2 more sources

Atomic Boolean Algebras and Classical Propositional Logic

2001
From the time of Boole and De Morgan, algebraic methods have been used to study logics. In this century, the customary vehicle for the application of algebra to logic has been the so-called natural or Lindenbaum algebra of the logical system being investigated.1 In the case of a formal axiomatization (logistic system) S of classical propositional logic
openaire   +1 more source

Ultravaluations and their Applications in Classical Propositional Logic

2023
The talk will be devoted to the notion of ultravaluation introduced in our recent paper published in Logica Universalis. We will focus on its applications for CPL which are analogous to the basic results in FOL achieved with the use of the well-known ultraproduct construction.
openaire   +1 more source

Substitutional Definition of Satisfiability in Classical Propositional Logic

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   +1 more source

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.
openaire   +1 more source

Classical Propositional Logic

1997
Jean Goubault-Larrecq, Ian Mackie
openaire   +1 more source

Depth-Bounded Reasoning:Volume I: Classical Propositional Logic [PDF]

The “cost of reasoning”, i.e. the cognitive and computational effort requiredby non-ideal, resource-bounded agents (whether human or artificial) in order to process available information, is a crucial issue in philosophy, AI,economics and cognitive science.
D'Agostino, Marcello, Gabbay, Dov, Larese, Costanza, Modgil, Sanjay   +3 more
openaire  

Automated Proof Systems Completeness of Classical Propositional Logic

2018
Hilbert style systems are easy to define and admit different proofs of the Completeness Theorem but they are difficult to use. By humans, not mentioning computers. Their emphasis is on logical axioms, keeping the rules of inference, with obligatory Modus Ponens, at a minimum.
openaire   +1 more source