Results 11 to 20 of about 97,467 (324)
Undecidability of Multiplicative Subexponential Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction.
Kaustuv Chaudhuri
doaj +8 more sources
An Holistic Extension for Classical Logic via Quantum Fredkin Gate [PDF]
Entropy, 2021 An holistic extension for classical propositional logic is introduced in the framework of quantum computation with mixed states. The mentioned extension is obtained by applying the quantum Fredkin gate to non-factorizable bipartite states. In particular,
Hector Freytes, Giuseppe Sergioli
doaj +2 more sources
Epistemic extensions of combined classical and intuitionistic propositional logic [PDF]
Logic Journal of the IGPL, 2016 Logic $L$ was introduced by Lewitzka [7] as a modal system that combines intuitionistic and classical logic: $L$ is a conservative extension of CPC and it contains a copy of IPC via the embedding $\varphi\mapsto\square\varphi$.
Steffen Lewitzka
semanticscholar +3 more sources
Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus
Lietuvos Matematikos Rinkinys, 2008 In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj +3 more sources
Naming Proofs in Classical Propositional Logic [PDF]
International Conference on Typed Lambda Calculus and Applications, 2005 We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut ...
François Lamarche, Lutz Straßburger
openaire +2 more sources
Proof-graphs for Minimal Implicational Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs.
Marcela Quispe-Cruz +2 more
doaj +4 more sources
Interpolation in Classical Propositional Logic
arXiv.orgWe introduce Craig interpolation and related notions such as uniform interpolation, Beth definability, and theory decomposition in classical propositional logic. We present four approaches to computing interpolants: via quantifier elimination, from formulas in disjunctive normal form, and by extraction from resolution or tableau refutations.
Koopmann, Patrick +2 more
openaire +3 more sources
A “Propositions as Types” Interpretation of Classical Logic [PDF]
This paper constructs a simple "propositions as types" interpretation for first-order classical propositional and first- and higher-order classical predicate logic. The idea is to study inhabited types and uninhabited types in general, which will be represented by \(\top\) and \(\bot\) respectively, and to show that standard Boolean algebra applies to ...
Andrew Powell
+5 more sources
Complementary Logics for Classical Propositional Languages [PDF]
KRITERION – Journal of Philosophy, 1992 Achille C. Varzi
openaire +2 more sources