Pages that link to "Item:Q5726687"

The following pages link to On weak completeness of intuitionistic predicate logic (Q5726687):

Displaying 37 items.

• On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem (Q265002) (← links)
• Semantic completeness of first-order theories in constructive reverse mathematics (Q286708) (← links)
• Intuitionistic completeness of first-order logic (Q392280) (← links)
• A complexity analysis of functional interpretations (Q557798) (← links)
• Kripke models for classical logic (Q636371) (← links)
• The modified realizability topos (Q678851) (← links)
• The metamathematics of ergodic theory (Q1006602) (← links)
• On theorems of Gödel and Kreisel: Completeness and Markov's principle (Q1333319) (← links)
• A realizability interpretation for classical analysis (Q1762729) (← links)
• The creating subject, the Brouwer-Kripke schema, and infinite proofs (Q1788337) (← links)
• Constructions and negationless logic (Q1845717) (← links)
• Intuitionistic completeness and classical logic (Q1882403) (← links)
• Formally computing with the non-computable (Q2117773) (← links)
• On Guaspari's problem about partially conservative sentences (Q2120971) (← links)
• Paraconsistent metatheory: new proofs with old tools (Q2155941) (← links)
• Non-classical metatheory for non-classical logics (Q2377187) (← links)
• Strongly uniform bounds from semi-constructive proofs (Q2498902) (← links)
• Reflexive intermediate propositional logics (Q2505130) (← links)
• The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb (Q2663342) (← links)
• Explicit provability and constructive semantics (Q2732527) (← links)
• Exercising Nuprl’s Open-Endedness (Q2819194) (← links)
• Partially Conservative Extensions of Arithmetic (Q3206949) (← links)
• A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
• Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus (Q3638285) (← links)
• Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
• An application of constructive completeness (Q4647571) (← links)
• CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
• GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION (Q4977225) (← links)
• GÖDEL’S SECOND INCOMPLETENESS THEOREM: HOW IT IS DERIVED AND WHAT IT DELIVERS (Q4984860) (← links)
• Explaining Deductive Inference (Q5213606) (← links)
• Gödel and Intuitionism (Q5250219) (← links)
• THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
• (Q5646882) (← links)
• On computational properties of Cauchy problems generated by accretive operators (Q6148761) (← links)
• Should pluralists be pluralists about pluralism? (Q6180134) (← links)
• Herbrandized modified realizability (Q6565573) (← links)
• \(\text{TT}^\Box_{\mathcal{C}}\): a family of extensional type theories with effectful realizers of continuity (Q6597949) (← links)