Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees

DOI10.1007/BF02007556zbMath0598.03045MaRDI QIDQ3731598

Stephen G. Simpson

Publication date: 1985

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/138037

zbMATH Keywords

proof theoryordinal notationsordinal analysisKruskal's theoremfragments of second order arithmeticembeddability properties of finite treesformal independence results

Mathematics Subject Classification ID

Trees (05C05) Second- and higher-order arithmetic and fragments (03F35) Recursive ordinals and ordinal notations (03F15)

Related Items

Necessary uses of abstract set theory in finite mathematics, Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen, Termination of rewriting, A new system of proof-theoretic ordinal functions, Recent Advances in Ordinal Analysis: Π¹₂— CA and Related Systems, European Summer Meeting of the Association for Symbolic Logic, Hull, 1986, An Unprovable Ramsey-Type Theorem, THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES, REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION, Proof-theoretic analysis of KPM, Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor, The constructive Hilbert program and the limits of Martin-Löf type theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordinal diagrams
• Countable algebra and set existence axioms
• A new system of proof-theoretic ordinal functions
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Wohlquasigeordnete Klassen endlicher Graphen
• ϱ-inaccessible ordinals, collapsing functions and a recursive notation system
• Which set existence axioms are needed to prove the Cauchy/Peano theorem for ordinary differential equations?
• The strength of admissibility without foundation
• On the role of Ramsey quantifiers in first order arithmetic
• Accessible Independence Results for Peano Arithmetic
• Two Applications of Logic to Mathematics
• Well-quasi-orderings and sets of finite sequences
• Systems of predicative analysis
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras