scientific article
From MaRDI portal
Publication:3395521
zbMath1181.03001MaRDI QIDQ3395521
Publication date: 4 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ATRACARCAreverse mathematicsweak König's lemmaWKLbeta modelarithmetical transfinite recursionHilbert's programarithmetical comprehensionrecursive comprehensionomega model\(\Pi^1_1\) comprehension
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Foundations of classical theories (including reverse mathematics) (03B30) Models of arithmetic and set theory (03C62) Second- and higher-order arithmetic and fragments (03F35)
Related Items (only showing first 100 items - show all)
Satisfaction relations for proper classes: Applications in logic and set theory ⋮ Partial impredicativity in reverse mathematics ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Realizability Models Separating Various Fan Theorems ⋮ THE STRENGTH OF ABSTRACTION WITH PREDICATIVE COMPREHENSION ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Any FIP real computes a 1-generic ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ Borel combinatorics fail in HYP ⋮ Algebraic properties of the first-order part of a problem ⋮ THE POTENTIAL IN FREGE’S THEOREM ⋮ What is effective transfinite recursion in reverse mathematics? ⋮ Decidable fan theorem and uniform continuity theorem with continuous moduli ⋮ König's lemma, weak König's lemma, and the decidable fan theorem ⋮ Primitive recursive reverse mathematics ⋮ Finitely axiomatized theories lack self‐comprehension ⋮ Banach’s theorem in higher-order reverse mathematics ⋮ Open determinacy for class games ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ A note on ordinal exponentiation and derivatives of normal functions ⋮ Coding of real‐valued continuous functions under WKL$\mathsf {WKL}$ ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Bachmann-Howard derivatives ⋮ Mixed Nash equilibria for continuous games and reverse mathematics ⋮ Carlson-Simpson's lemma and applications in reverse mathematics ⋮ Littlewood's principles in reverse real analysis ⋮ VARIETIES OF CLASS-THEORETIC POTENTIALISM ⋮ Corrigendum to Reducing ω-model reflection to iterated syntactic reflection ⋮ On the logical strength of the better quasi order with three elements ⋮ Foundations of applied mathematics. I ⋮ Punctually presented structures I: Closure theorems ⋮ Variations of statement, variations of strength. The case of the Rival-Sands theorems ⋮ TWO-SORTED FREGE ARITHMETIC IS NOT CONSERVATIVE ⋮ The non-normal abyss in Kleene's computability theory ⋮ A constructive picture of Noetherian conditions and well quasi-orders ⋮ On the complexity of learning programs ⋮ On the computational properties of the uncountability of the real numbers ⋮ PREDICATIVITY THROUGH TRANSFINITE REFLECTION ⋮ The coding power of a product of partitions ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Milliken’s Tree Theorem and Its Applications: A Computability-Theoretic Perspective ⋮ (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ A NOTE ON THE REVERSE MATHEMATICS OF THE SORITES ⋮ AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING ⋮ A categorical construction of Bachmann–Howard fixed points ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ The Interpretation Existence Lemma ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ Feferman and the Truth ⋮ Proof Theory of Constructive Systems: Inductive Types and Univalence ⋮ Thin set theorems and cone avoidance ⋮ MINIMUM MODELS OF SECOND-ORDER SET THEORIES ⋮ A model of second-order arithmetic satisfying AC but not DC ⋮ On the mathematical and foundational significance of the uncountable ⋮ On the computability of perfect subsets of sets with positive measure ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? ⋮ Cohesive avoidance and strong reductions ⋮ A packed Ramsey’s theorem and computability theory ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ WEIHRAUCH GOES BROUWERIAN ⋮ To reorient is easier than to orient: An on-line algorithm for reorientation of graphs ⋮ Classical provability of uniform versions and intuitionistic provability ⋮ AXIOMATIZING SEMANTIC THEORIES OF TRUTH? ⋮ Lawvere-Tierney topologies for computability theorists ⋮ EQUIVALENCES FOR TRUTH PREDICATES ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC ⋮ An inside/outside Ramsey theorem and recursion theory ⋮ Reverse mathematics and Weihrauch analysis motivated by finite complexity theory ⋮ Countable sets versus sets that are countable in reverse mathematics ⋮ Reverse Mathematics: The Playground of Logic ⋮ A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC ⋮ A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ Measure theory and higher order arithmetic ⋮ ON THE UNCOUNTABILITY OF ⋮ Open Questions in Reverse Mathematics ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Reduction games, provability and compactness ⋮ Computability and Analysis, a Historical Approach ⋮ FRAGMENTS OF FREGE’SGRUNDGESETZEAND GÖDEL’S CONSTRUCTIBLE UNIVERSE ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS ⋮ RAMSEY-LIKE THEOREMS AND MODULI OF COMPUTATION ⋮ THE REVERSE MATHEMATICS OF THE THIN SET AND ERDŐS–MOSER THEOREMS ⋮ Cousin’s lemma in second-order arithmetic ⋮ FREGE MEETS BROUWER (OR HEYTING OR DUMMETT) ⋮ Error and Predicativity ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ THE Σ1-DEFINABLE UNIVERSAL FINITE SEQUENCE ⋮ Derived sequences and reverse mathematics ⋮ STRICT FINITISM, FEASIBILITY, AND THE SORITES ⋮ CONSERVATIVITY OF ULTRAFILTERS OVER SUBSYSTEMS OF SECOND ORDER ARITHMETIC ⋮ THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY
This page was built for publication:
