Results 281 to 290 of about 97,467 (324)

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

Proof-Search in Natural Deduction Calculus for Classical Propositional Logic

International Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2015
Mauro Ferrari, Camillo Fiorentini
semanticscholar   +1 more source

Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic

Studia Logica: An International Journal for Symbolic Logic, 2013
M. Kaminski, N. Francez
semanticscholar   +1 more source

Falsification-Aware Semantics and Sequent Calculi for Classical Logic

Journal of Philosophical Logic, 2021
N. Kamide
semanticscholar   +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

A reduction of classical propositional logic to the conjunction-negation fragment of an intuitionistic relevant logic

Journal of Philosophical Logic, 1981
K. Dosen
semanticscholar   +1 more source

A New Normalization Strategy for the Implicational Fragment of Classical Propositional Logic

Studia Logica: An International Journal for Symbolic Logic, 2010
L. C. Pereira, E. Haeusler, Vaston G. Costa, W. Sanz   +3 more
semanticscholar   +1 more source

Logic-in-memory based on an atomically thin semiconductor

Nature, 2020
Guilherme Migliato Marega, Ahmet Avsar, Zhenyu Wang   +2 more
exaly