ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
From MaRDI portal
Publication:3262780
DOI10.1111/j.1746-8361.1958.tb01464.xzbMath0090.01003WikidataQ55897078 ScholiaQ55897078MaRDI QIDQ3262780
Publication date: 1958
Published in: Dialectica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1746-8361.1958.tb01464.x
03F50: Metamathematics of constructive systems
Related Items
Intrinsic reasoning about functional programs. I: First order theories, Finite methods in 1-order formalisms, New effective moduli of uniqueness and uniform a priori estimates for constants of strong unicity by logical analysis of known proofs in best approximation theory, Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen, Extensions of the Finitist Point of View, Some logical metatheorems with applications in functional analysis, Platonism and Mathematical Intuition in Kurt Gödel's Thought, XI Latin American Symposium on Mathematical Logic, On the No-Counterexample Interpretation, Unnamed Item, Unnamed Item, Unnamed Item, General logical metatheorems for functional analysis, Bounded modified realizability, Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis, Intensional interpretations of functionals of finite type I, A survey of proof theory, Ein Henkin-Vollständigkeitsbeweis für die intuitionistische Prädikatelogik bezüglich der Kripke-Semantik, Simultane Rekursionen in der Theorie der Funktionale endlicher Typen, A classification of the ordinal recursive functions, A system of abstract constructive ordinals, Computability and Recursion, On weak completeness of intuitionistic predicate logic, Logical problems of functional interpretations, Proof theory in the abstract, On uniform weak König's lemma, Functional Interpretations of Intuitionistic Linear Logic, A complexity analysis of functional interpretations, Computability in higher types, P\(\omega\) and the completeness of type assignment, Functional interpretations of feasibly constructive arithmetic, Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation, Subrecursive hierarchies on Scott domains, Realizability and intuitionistic logic, Propositions and specifications of programs in Martin-Löf's type theory, Pointwise hereditary majorization and some applications, Binary refinement implies discrete exponentiation, Bounded functional interpretation and feasible analysis, Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006, Proofs and programs: A naïve approach to program extraction, Functional interpretations of linear and intuitionistic logic, On the form of witness terms, The metamathematics of ergodic theory, Injecting uniformities into Peano arithmetic, Realizability interpretation of proofs in constructive analysis, A proof description language and its reduction system, A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction, Automatic synthesis of typed \(\Lambda\)-programs on term algebras, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, The machinery of consistency proofs, Beweistheoretische Abgrenzung von Teilsystemen der Analysis, Intuitionist type theory and the free topos, Pre-recursive categories, A game semantics for linear logic, The undecidability of pattern matching in calculi where primitive recursive functions are representable, Non-classical propositional calculi in relation to methodological patterns of scientific investigation, Kurt Gödel's intellectual development. [In memoriam Kurt Gödel (28 April 1906 -- 14 January 1978).], Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\), A common axiom set for classical and intuitionistic plane geometry, On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness, Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity, Studies in constructive mathematics and mathematical logic. Part IX, Higher type recursion, ramification and polynomial time, Functional interpretation of Aczel's constructive set theory, An equational variant of Lawvere's natural numbers object, Continuous normalization for the lambda-calculus and Gödel's T, Uniform Heyting arithmetic, Georg Cantor as the author of constructions playing fundamental roles in constructive mathematics, A unary representation result for system \(T\), Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers), An arithmetic for non-size-increasing polynomial-time computation, Proof mining in \(L_{1}\)-approximation, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Polymorphic extensions of simple type structures. With an application to a bar recursive minimization, Things that can and things that cannot be done in PRA, The intuitionistic fragment of computability logic at the propositional level, Programs from proofs using classical dependent choice, Extracting Herbrand disjunctions by functional interpretation, Bounded functional interpretation, An arithmetic for polynomial-time computation, Explicit Provability and Constructive Semantics, On the computational content of the Bolzano-Weierstraß Principle, Light monotone Dialectica methods for proof mining, Spielquantorinterpretation unstetiger Funktionale der höheren Analysis, Local stability of ergodic averages, Classifying the Provably Total Functions of PA, The bounded functional interpretation of the double negation shift, Dialectica Interpretation with Fine Computational Control, Least and Greatest Fixpoints in Game Semantics, Complexity of Gödel’s T in λ-Formulation, Functional interpretation and inductive definitions, Logical aspects of rates of convergence in metric spaces, Strong normalization of barrecursive terms without using infinite terms, Global quantification in Zermelo-Fraenkel set theory, Unnamed Item, Provably total functions of intuitionistic bounded arithmetic, Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization, Extending the Curry-Howard interpretation to linear, relevant and other resource logics, The work of Kurt Gödel, A sequent calculus for type assignment, Interpretationen der Heyting-Arithmetik endlicher Typen, Relative constructivity, How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study
