Propositional Calculus and Realizability
From MaRDI portal
Publication:5822056
DOI10.2307/1990776zbMath0053.19901OpenAlexW4213339592MaRDI QIDQ5822056
Publication date: 1953
Full work available at URL: https://doi.org/10.2307/1990776
Related Items
V. Yankov’s Contributions to Propositional Logic, An Application of the Yankov Characteristic Formulas, On superintuitionistic logics as fragments of proof logic extensions, Coherence in SMCCs and equivalences on derivations in IMML with unit, Fuzzy constructive logic, Some obstacles facing a semantic foundation for constructive mathematics, A series of successive modifications of Peirce's rule, Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels, Intuitive counterexamples for constructive fallacies, Modal logics with LM-axioms, Realizability and finite validity of propositional formulas with restrictions on the occurrence of implication, The Deduction Theorem (Before and After Herbrand), Satisfiability is false intuitionistically: a question from Dana Scott, Intermediate logics and the de Jongh property, Tarski's theorem on intuitionistic logic, for polyhedra, Realisability for infinitary intuitionistic set theory, Preservation of equivalence of derivations under reduction of depth of formulas, Reductions in Intuitionistic Linear Logic, The disjunction property of intermediate propositional logics, Logics of intuitionistic Kripke-Platek set theory, A semantic hierarchy for intuitionistic logic, Rules and arithmetics, On abstract resource semantics and computability logic, On Jaskowski-type semantics for the intuitionistic propositional logic, On the rules of intermediate logics, Equational axioms for classes of Heyting algebras, Kripke models, distributive lattices, and Medvedev degrees, A survey of predicate realizability logic, The Context of Inference, An epistemic approach to paraconsistency: a logic of evidence and truth, On the realizations of predicate formulas, A class of realizable propositional formulas, On the Blok-Esakia Theorem
Cites Work
- Unnamed Item
- Unnamed Item
- A set of postulates for the foundation of logic
- Untersuchungen über das logische Schliessen. I
- On notation for ordinal numbers
- Proofs of non-deducibility in intuitionistic functional calculus
- Some theorems about the sentential calculi of Lewis and Heyting
- An algebraic characterization of quantifiers
- Recursive Functions and Intuitionistic Number Theory
- Recursive Predicates and Quantifiers
- On the interpretation of intuitionistic number theory
