Pages that link to "Item:Q2703802"

The following pages link to A short introduction to intuitionistic logic (Q2703802):

Displaying 40 items.

• Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
• Completeness of \(\mathrm S4\) for the Lebesgue measure algebra (Q427238) (← links)
• An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
• Some topological properties of paraconsistent models (Q484905) (← links)
• Minimal change: relevance and recovery revisited (Q490421) (← links)
• On expressive power of basic modal intuitionistic logic as a fragment of classical FOL (Q518747) (← links)
• On intuitionistic modal and tense logics and their classical companion logics: topological semantics and bisimulations (Q636275) (← links)
• Hypersequent calculi for intuitionistic logic with classical atoms (Q636282) (← links)
• Cut elimination for S4C: A case study (Q817705) (← links)
• Negational fragment of intuitionistic control logic (Q897473) (← links)
• Second-order abstract categorial grammars as hyperedge replacement grammars (Q972434) (← links)
• HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
• Intuitionistic logic according to Dijkstra's calculus of equational deduction (Q1049739) (← links)
• Constructive logics. I: A tutorial on proof systems and typed \(\lambda\)- calculi (Q1208732) (← links)
• The logic of information structures (Q1310268) (← links)
• A proof of topological completeness for S4 in \((0,1)\) (Q1772779) (← links)
• Kripke semantics for fuzzy logics (Q1797765) (← links)
• Computing interpolants in implicational logics (Q2503400) (← links)
• Failure of interpolation in constant domain intuitionistic logic (Q2869908) (← links)
• The Gödel-Tarski Translations of Intuitionistic Propositional Formulas (Q2900543) (← links)
• The Friedman-Sheard programme in intuitionistic logic (Q2915893) (← links)
• Basic Constructive Connectives, Determinism and Matrix-Based Semantics (Q3010364) (← links)
• Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
• A polynomial translation of <i>S</i>4 into intuitionistic logic (Q3410685) (← links)
• (Q3481670) (← links)
• DKAL and Z3: A Logic Embedding Experiment (Q3586018) (← links)
• Automating Theories in Intuitionistic Logic (Q3655199) (← links)
• Proving infinitary formulas (Q4593059) (← links)
• 2002–2003 Winter Meeting of the Association for Symbolic Logic (Q4650300) (← links)
• COMPLETE INTUITIONISTIC TEMPORAL LOGICS FOR TOPOLOGICAL DYNAMICS (Q5100046) (← links)
• (Q5202655) (← links)
• Intuitionistic Existential Instantiation and Epsilon Symbol (Q5213612) (← links)
• Topological Semantics for da Costa Paraconsistent Logics $$C_\omega $$ C ω and $$C^{*}_\omega $$ C ω ∗ (Q5241535) (← links)
• An Arithmetical Interpretation of Verification and Intuitionistic Knowledge (Q5283437) (← links)
• Exploring the Jungle of Intuitionistic Temporal Logics (Q6063858) (← links)
• Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs (Q6063883) (← links)
• Conservative translations revisited (Q6156208) (← links)
• Infinitary logic with infinite sequents: syntactic investigations (Q6561653) (← links)
• Combining first-order classical and intuitionistic logic (Q6659896) (← links)
• Gödel-Dummett linear temporal logic (Q6665714) (← links)