Pages that link to "Item:Q3262780"
From MaRDI portal
The following pages link to ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES (Q3262780):
Displaying 50 items.
- A decidable theory of type assignment (Q365669) (← links)
- On bounded functional interpretations (Q424545) (← links)
- The bounded functional interpretation of bar induction (Q435192) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Gödel functional interpretation and weak compactness (Q450951) (← links)
- Fatal Heyting algebras and forcing persistent sentences (Q454370) (← links)
- Binary trees as a computational framework (Q461478) (← links)
- On the concept of finitism (Q510710) (← links)
- Bar recursion over finite partial functions (Q515562) (← links)
- Consistency, models, and soundness (Q551223) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- On quantitative versions of theorems due to F. E. Browder and R. Wittmann (Q624339) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- Light Dialectica revisited (Q636373) (← links)
- Extraction of expansion trees (Q670704) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- Subrecursive hierarchies on Scott domains (Q688507) (← links)
- Effective metastability of Halpern iterates in \(CAT(0)\) spaces (Q715208) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Propositions and specifications of programs in Martin-Löf's type theory (Q800719) (← links)
- Pointwise hereditary majorization and some applications (Q805612) (← links)
- Binary refinement implies discrete exponentiation (Q861570) (← links)
- Bounded functional interpretation and feasible analysis (Q866559) (← links)
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 (Q873911) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Proofs and programs: A naïve approach to program extraction (Q912594) (← links)
- Functional interpretations of linear and intuitionistic logic (Q964504) (← links)
- On the form of witness terms (Q982183) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- Injecting uniformities into Peano arithmetic (Q1006608) (← links)
- Realizability interpretation of proofs in constructive analysis (Q1015381) (← links)
- A proof description language and its reduction system (Q1055769) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Automatic synthesis of typed \(\Lambda\)-programs on term algebras (Q1079357) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- The machinery of consistency proofs (Q1124588) (← links)
- Beweistheoretische Abgrenzung von Teilsystemen der Analysis (Q1139586) (← links)
- Intuitionist type theory and the free topos (Q1148318) (← links)
- Pre-recursive categories (Q1164127) (← links)
- A game semantics for linear logic (Q1192350) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- Non-classical propositional calculi in relation to methodological patterns of scientific investigation (Q1212922) (← links)
- Kurt Gödel's intellectual development. [In memoriam Kurt Gödel (28 April 1906 -- 14 January 1978)]. (Q1252211) (← links)
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) (Q1295369) (← links)
- A common axiom set for classical and intuitionistic plane geometry (Q1295418) (← links)
- On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness (Q1295420) (← links)
- Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
- Studies in constructive mathematics and mathematical logic. Part IX (Q1307304) (← links)
