Results 11 to 20 of about 20,888 (254)

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.
Rosella Hermens
openalex   +6 more sources

Intuitionistic Logic is a Connexive Logic [PDF]

Studia Logica, 2022
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, A Ledda, Francesco Paoli
openalex   +6 more sources

Dualized Simple Type Theory [PDF]

Logical Methods in Computer Science, 2017
We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus.
Harley Eades III, Aaron Stump, Ryan McCleeary   +2 more
doaj   +3 more sources

Functional Interpretations of Intuitionistic Linear Logic [PDF]

Logical Methods in Computer Science, 2011
We present three different functional interpretations of intuitionistic linear logic ILL and show how these correspond to well-known functional interpretations of intuitionistic logic IL via embeddings of IL into ILL.
Gilda Ferreira, Paulo Oliva
doaj   +2 more sources

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   +5 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   +4 more sources

Intuitionistic computability logic [PDF]

, 2004
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and "truth" is understood as algorithmic solvability, CL ...
Japaridze, Giorgi
openaire   +5 more sources

Speakable in quantum mechanics: babbling on [PDF]

Electronic Proceedings in Theoretical Computer Science, 2014
This paper consists of a short version of the derivation of the intuitionistic quantum logic L_QM (which was originally introduced by Caspers, Heunen, Landsman and Spitters).
Ronnie Hermens
doaj   +4 more sources

Gödel's modal interpretation of intuitionistic logic and its proof theory. [PDF]

Mon Hefte Math
von Plato J.
europepmc   +3 more sources

A Characterisation of Open Bisimilarity using an Intuitionistic Modal Logic [PDF]

Logical Methods in Computer Science, 2021
Open bisimilarity is defined for open process terms in which free variables may appear. The insight is, in order to characterise open bisimilarity, we move to the setting of intuitionistic modal logics. The intuitionistic modal logic introduced, called $\
Ki Yung Ahn, Ross Horne, Alwen Tiu
doaj   +1 more source