The following pages link to (Q4179016):
Displaying 50 items.
- A semantic approach to conservativity (Q284219) (← links)
- Fluctuations, effective learnability and metastability in analysis (Q392289) (← links)
- The Peirce translation (Q408162) (← links)
- Internal models of system F for decompilation (Q428882) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- Epistemic and intuitionistic formal systems (Q580343) (← links)
- Intermediate logics and the de Jongh property (Q627438) (← links)
- Intuitionistic validity in \(T\)-normal Kripke structures (Q685055) (← links)
- Pedagogical second-order \(\lambda \)-calculus (Q732007) (← links)
- Large sets in intuitionistic set theory (Q796524) (← links)
- Proof-theoretical analysis: Weak systems of functions and classes (Q911585) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories (Q1071017) (← links)
- Group completions and limit sets of Kleinian groups (Q1137125) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- On theorems of Gödel and Kreisel: Completeness and Markov's principle (Q1333319) (← links)
- A constructive valuation semantics for classical logic (Q1355127) (← links)
- Classical realizability in the CPS target language (Q1744381) (← links)
- The computational content of arithmetical proofs (Q1762353) (← links)
- A realizability interpretation for classical analysis (Q1762729) (← links)
- Intuitionistically provable recursive well-orderings (Q1820780) (← links)
- A strong normalization result for classical logic (Q1902976) (← links)
- Induction, constructivity, and grounding (Q1981997) (← links)
- Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) (Q2074812) (← links)
- Maximal ideals in countable rings, constructively (Q2104249) (← links)
- Satisfiability is false intuitionistically: a question from Dana Scott (Q2193975) (← links)
- The FAN principle and weak König's lemma in Herbrandized second-order arithmetic (Q2195636) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- Axioms for control operators in the CPS hierarchy (Q2464730) (← links)
- Programs from proofs using classical dependent choice (Q2482844) (← links)
- Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert) (Q2575772) (← links)
- Automated Constructivization of Proofs (Q2988387) (← links)
- A Classical Sequent Calculus with Dependent Types (Q2988668) (← links)
- Verificationism and Classical Realizability (Q3305313) (← links)
- Dialectica interpretation of well-founded induction (Q3506320) (← links)
- A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) (Q3540181) (← links)
- Realizability algebras III: some examples (Q4599612) (← links)
- The greatest common divisor: A case study for program extraction from classical proofs (Q4647568) (← links)
- The Friedman‐Translation for Martin‐Löf's Type Theory (Q4844507) (← links)
- PRENEX NORMAL FORM THEOREMS IN SEMI-CLASSICAL ARITHMETIC (Q5015727) (← links)
- Classical realizability and arithmetical formulæ (Q5360216) (← links)
- A New Translation for Semi-classical Theories — Backtracking without CPS (Q5458438) (← links)
- Intuitionistic open induction and least number principle and the Buss operator (Q5937815) (← links)
- Refined program extraction from classical proofs (Q5957850) (← links)
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic (Q5957858) (← links)
- Program extraction from classical proofs (Q6064277) (← links)
- Core Gödel (Q6100981) (← links)
