Unfolding Schematic Systems

DOI10.1007/978-3-319-63334-3_8zbMath1429.03195OpenAlexW2795079260MaRDI QIDQ5214786

Thomas Strahm

Publication date: 5 February 2020

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-63334-3_8

zbMATH Keywords

unfoldinginductive definitionsfeasible arithmeticnon-finitist arithmeticfinitist arithmeticschematic systems

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03) Abstract and axiomatic computability and recursion theory (03D75)

Related Items

Predicativity and Feferman, Reflecting and unfolding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Operational set theory and small large cardinals
• Nested recursion
• The unfolding of non-finitist arithmetic
• The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule
• On Feferman's operational set theory \textsf{OST}
• A feasible theory of truth over combinatory algebra
• Herbrand analyses
• UNFOLDING FINITIST ARITHMETIC
• The Operational Perspective: Three Routes
• Reflecting on incompleteness
• The role of parameters in bar rule and bar induction
• Outline of a Theory of Truth
• Transfinite Progressions: A Second Look at Completeness
• Theories of Proof-Theoretic Strength Ψ (Γ_Ω +1)
• Systems of predicative analysis
• Eine Grenze Für die Beweisbarkeit der Transfiniten Induktion in der Verzweigten Typenlogik
• Transfinite recursive progressions of axiomatic theories
• Incompleteness along paths in progressions of theories