Results 1 to 10 of about 97,467 (324)
Classical propositional logic and decidability of variables in intuitionistic propositional logic [PDF]
Logical Methods in Computer Science, 2014 We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.
Hajime Ishihara
doaj +9 more sources
On the Predictability of Classical Propositional Logic [PDF]
Information, 2013 In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction,
Poliana M. Reis, Marcelo Finger
doaj +5 more sources
A modal logic amalgam of classical and intuitionistic propositional logic [PDF]
Journal of Logic and Computation, 2015 A famous result, conjectured by G del in 1932 and proved by McKinsey and Tarski in 1948, says that $ $ is a theorem of intuitionistic propositional logic IPC iff its G del-translation $ '$ is a theorem of modal logic S4. In this paper, we extend an intuitionistic version of modal logic S1+SP, introduced in our previous paper (S. Lewitzka, Algebraic
Steffen Lewitzka
semanticscholar +7 more sources
Isomorphic formulae in classical propositional logic [PDF]
Mathematical Logic Quarterly, 2011 AbstractIsomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions.
Došen, Kosta, Petrić, Zoran
semanticscholar +7 more sources
Encoding Lifted Classical Planning in Propositional Logic
Proceedings of the International Conference on Automated Planning and Scheduling, 2022 Planning models are usually defined in lifted, i.e. first order formalisms, while most solvers need (variable-free) grounded representations. Though techniques for grounding prune unnecessary parts of the model, grounding might – nevertheless – be prohibitively expensive in terms of runtime.
Höller, Daniel, Behnke, Gregor
semanticscholar +5 more sources
Teaching Intuitionistic and Classical Propositional Logic Using Isabelle [PDF]
Electronic Proceedings in Theoretical Computer Science, 2022 In Proceedings ThEdu'21, arXiv:2202 ...
Villadsen, Jørgen +2 more
semanticscholar +6 more sources
Unification with parameters in the implication fragment of classical propositional logic
Logic Journal of the IGPL, 2021 In this paper, we show that the implication fragment of classical propositional logic is finitary for unification with parameters.
P. Balbiani, Mojtaba Mojtahedi
semanticscholar +3 more sources
A note on cut-elimination for classical propositional logic [PDF]
Archive for Mathematical Logic, 2021 In Schwichtenberg (Studies in logic and the foundations of mathematics, vol 90, Elsevier, pp 867–895, 1977), Schwichtenberg fine-tuned Tait’s technique (Tait in The syntax and semantics of infinitary languages, Springer, pp 204–236, 1968) so as to ...
G. Pulcini
semanticscholar +2 more sources
Bicategorical Models of Classical Propositional Logic [PDF]
, 2023 Führmann and Pym constructed models of classical propositional logic in an order-enriched categorical setting, whose typical example is the category $\mathbf{Rel}$ of sets and relations. It is remarkable in that they are both non-degenerate and symmetric, i.e., free from the choices of the reduction strategy.
Yuta Yamamoto
openaire +3 more sources
Combining intermediate propositional logics with classical logic [PDF]
, 2015 18 ...
Steffen Lewitzka
openaire +3 more sources