Results 21 to 30 of about 2,755 (229)
Propositional Logics Complexity and the Sub-Formula Property [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete.
Edward Hermann Haeusler
doaj +1 more source
Weakly Intuitionistic Quantum Logic [PDF]
Studia Logica, 2012 In this paper we motivate and study the possibility of an intuitionistic quantum logic. An explicit investigation of the application of the theory of Bruns and Lakser on distributive hulls on traditional quantum logic (as suggested in [Coe]) leads us to a small modification of this scheme. In this way we obtain a weak Heyting algebra (cf.
openaire +4 more sources
Minimal Systems of Temporal Logic
Axioms, 2020 The article discusses minimal temporal logic systems built on the basis of classical logic as well as intuitionistic logic. The constructions of these systems are discussed as well as their basic properties.
Dariusz Surowik
doaj +1 more source
Intuitionistic Linear Temporal Logics [PDF]
ACM Transactions on Computational Logic, 2019 We consider intuitionistic variants of linear temporal logic with “next,” “until,” and “release” based on expanding posets : partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic that we denote ITL e , and by imposing additional ...
Philippe Balbiani +3 more
openaire +4 more sources
Towards the Integration of an Intuitionistic First-Order Prover into Coq [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 An efficient intuitionistic first-order prover integrated into Coq is useful to replay proofs found by external automated theorem provers. We propose a two-phase approach: An intuitionistic prover generates a certificate based on the matrix ...
Fabian Kunze
doaj +1 more source
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 +1 more source
Intersection Logic in sequent calculus style [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus.
Simona Ronchi Della Rocca +3 more
doaj +1 more source
Intuitionistic Logic is a Connexive Logic
Studia Logica, 2023 AbstractWe show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic ($$\textrm{CHL}$$ CHL ), hereby introduced as an example of a strongly connexive logic with an intuitive semantics. We use the reverse algebraisation paradigm: $$\textrm{CHL}$$ CHL is ...
davide fazio +2 more
openaire +5 more sources
Co-constructive Logics for Proofs and Refutations
Studia Humana, 2015 This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and
Trafford James
doaj +1 more source
Studia Logica, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources