scientific article; zbMATH DE number 1226875

zbMath0909.03048MaRDI QIDQ4220572

Publication date: 25 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

reverse mathematics weak König's lemma arithmetical transfinite recursion subsystems of second-order arithmetic Hilbert's program set existence axioms arithmetical comprehension recursive comprehension \(\omega\)-models \(\Pi^1_1\) comprehension \(\beta\)-models non-\(\omega\)-models

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35)

Related Items (only showing first 100 items - show all)

Proof Theory in Philosophy of Mathematics ⋮ 2000 Annual Meeting of the Association for Symbolic Logic ⋮ Relative Truth Definability of Axiomatic Truth Theories ⋮ Why Predicative Sets? ⋮ Infinite games in the Cantor space and subsystems of second order arithmetic ⋮ Δ₃^O-determinacy, comprehension and induction ⋮ TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS ⋮ On Arbitrary sets andZFC ⋮ On the Performance of Axiom Systems ⋮ Reduction games, provability and compactness ⋮ 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ On notions of computability-theoretic reduction between Π21 principles ⋮ Almost everywhere domination and superhighness ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ An incompleteness theorem for β_n-models ⋮ Some logical metatheorems with applications in functional analysis ⋮ THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS ⋮ RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES ⋮ Degrees of Unsolvability: A Tutorial ⋮ APPROXIMATING BEPPO LEVI’S PRINCIPIO DI APPROSSIMAZIONE ⋮ NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS ⋮ RELATIVE PREDICATIVITY AND DEPENDENT RECURSION IN SECOND-ORDER SET THEORY AND HIGHER-ORDER THEORIES ⋮ Effective prime uniqueness ⋮ Effective versions of Ramsey's Theorem: Avoiding the cone above 0′ ⋮ Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic ⋮ Two kinds of fixed point theorems and reverse mathematics ⋮ Phase Transitions for Weakly Increasing Sequences ⋮ Complete Determinacy and Subsystems of Second Order Arithmetic ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ Second-Order Logic and Foundations of Mathematics ⋮ Orders on computable rings ⋮ Some Questions in Computable Mathematics ⋮ Non‐standard Analysis in WKL₀ ⋮ On the Π₁ ¹ -separation principle ⋮ Non-elementary speed-ups in logic calculi ⋮ A Combinatorial Bound for a Restricted Form of the Termination Theorem ⋮ Ordinal arithmetic with simultaneously defined theta-functions ⋮ On the role of the collection principle for Σ⁰₂-formulas in second-order reverse mathematics ⋮ The Barwise-Schlipf theorem ⋮ The Operational Perspective: Three Routes ⋮ From Subsystems of Analysis to Subsystems of Set Theory ⋮ Objectivity and Truth in Mathematics: A Sober Non-platonist Perspective ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ The cohesive principle and the Bolzano-Weierstraß principle ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Weak systems of determinacy and arithmetical quasi-inductive definitions ⋮ The Veblen functions for computability theorists ⋮ On the strength of Ramsey's theorem without Σ₁‐induction ⋮ How Incomputable is the Separable Hahn-Banach Theorem? ⋮ ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH ⋮ Reverse mathematics and Ramsey's property for trees ⋮ Unnamed Item ⋮ On the Equimorphism Types of Linear Orderings ⋮ On Tao's “finitary” infinite pigeonhole principle ⋮ On the (semi)lattices induced by continuous reducibilities ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Chain conditions in computable rings ⋮ 1999 European Summer Meeting of the Association for Symbolic Logic ⋮ Formalizing non-standard arguments in second-order arithmetic ⋮ Reverse mathematics, computability, and partitions of trees ⋮ Finding paths through narrow and wide trees ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ A note on standard systems and ultrafilters ⋮ Partition Theorems and Computability Theory ⋮ Mass Problems and Randomness ⋮ The isomorphism problem for computable Abelian _p-groups of bounded length ⋮ Determinacy of Wadge classes and subsystems of second order arithmetic ⋮ On a question of Andreas Weiermann ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Concrete Mathematical Incompleteness: Basic Emulation Theory ⋮ Predicativity and Feferman ⋮ Noetherian orders ⋮ Weihrauch degrees, omniscience principles and weak computability ⋮ Hindman's theorem: an ultrafilter argument in second order arithmetic ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Ramsey's theorem and cone avoidance ⋮ Stability and posets ⋮ When are Two Algorithms the Same? ⋮ WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Classical mathematics for a constructive world ⋮ A pluralist approach to the formalisation of mathematics ⋮ The atomic model theorem and type omitting ⋮ BOUNDS FOR INDEXES OF NILPOTENCY IN COMMUTATIVE RING THEORY: A PROOF MINING APPROACH ⋮ Local stability of ergodic averages ⋮ Mass Problems and Measure-Theoretic Regularity ⋮ Uniform almost everywhere domination ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ Unique solutions ⋮ Reverse mathematics and infinite traceable graphs ⋮ Combinatorial principles weaker than Ramsey's Theorem for pairs ⋮ Bounding homogenous models ⋮ Reverse Mathematics and Recursive Graph Theory ⋮ Classification from a Computable Viewpoint ⋮ THE EXPRESSIVE POWER OF TRUTH ⋮ Non-standard analysis in ACA0 and Riemann mapping theorem ⋮ THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE ⋮ Bishop-Style Constructive Reverse Mathematics ⋮ Groundwork for weak analysis ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

This page was built for publication: