On weak completeness of intuitionistic predicate logic
From MaRDI portal
Publication:5726687
DOI10.2307/2964110zbMath0117.01005OpenAlexW2071514253MaRDI QIDQ5726687
Publication date: 1963
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2964110
Related Items
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem, On Guaspari's problem about partially conservative sentences, On theorems of Gödel and Kreisel: Completeness and Markov's principle, Intuitionistic completeness and classical logic, Semantic completeness of first-order theories in constructive reverse mathematics, Non-classical metatheory for non-classical logics, Paraconsistent metatheory: new proofs with old tools, The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb, Intuitionistic completeness of first-order logic, On computational properties of Cauchy problems generated by accretive operators, Should pluralists be pluralists about pluralism?, Kripke models for classical logic, A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms, Explicit Provability and Constructive Semantics, Validating Brouwer's continuity principle for numbers using named exceptions, The modified realizability topos, An application of constructive completeness, A realizability interpretation for classical analysis, A complexity analysis of functional interpretations, Unnamed Item, Strongly uniform bounds from semi-constructive proofs, Reflexive intermediate propositional logics, The creating subject, the Brouwer-Kripke schema, and infinite proofs, Partially Conservative Extensions of Arithmetic, CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS, The metamathematics of ergodic theory, Explaining Deductive Inference, Exercising Nuprl’s Open-Endedness, Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus, GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION, GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS, Gödel and Intuitionism, Constructions and negationless logic, Formally computing with the non-computable, THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
Cites Work
