Results 11 to 20 of about 2,755 (229)
HH∗−intuitionistic heyting valued Ω-algebra and homomorphism [PDF]
Intuitionistic Logic was introduced by L. E. J. Brouwer in[1] and Heyting algebra was defined by A. Heyting to formalize the Brouwer’s intuitionistic logic[4]. The concept of Heyting algebra has been accepted as the basis for intuitionistic propositional
Sinem Tarsuslu(Yılmaz) +1 more
doaj +1 more source
Intuitionistic fixed point logic [PDF]
We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction ...
Berger, Ulrich, Tsuiki, Hideki
openaire +4 more sources
Dualized Simple Type Theory [PDF]
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 +2 more
doaj +1 more source
Truthmaker Semantics for Intuitionistic Modal Logic. [PDF]
Litland JE.
europepmc +3 more sources
Relating Sequent Calculi for Bi-intuitionistic Propositional Logic [PDF]
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic.
Luís Pinto, Tarmo Uustalu
doaj +1 more source
Intuitionistic implication makes model checking hard [PDF]
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
Dual-Intuitionistic Logic [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
Generalized Ideals of BCK/BCI-Algebras Based on Fuzzy Soft Set Theory
In the present paper, using Lukaswize triple-valued logic, we introduce the notion of α,β-intuitionistic fuzzy soft ideal of BCK/BCI-algebras, where α and β are the membership values between an intuitionistic fuzzy soft point and intuitionistic fuzzy set.
G. Muhiuddin +3 more
doaj +1 more source

