Results 1 to 10 of about 44,803 (280)
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 +6 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 +2 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
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
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
Lewitzka, Steffen
openaire +3 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
Stone-Type Dualities for Separation Logics [PDF]
Logical Methods in Computer Science, 2019 Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a ...
Simon Docherty, David Pym
doaj +5 more sources
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj +1 more source
On the Succinctness of Atoms of Dependency [PDF]
Logical Methods in Computer Science, 2019 Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj +1 more source
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
openaire +3 more sources