Iterated reflection principles and the ω-rule

DOI10.2307/2273094zbMath0501.03039OpenAlexW2335350341MaRDI QIDQ3966133

Ulf R. Schmerl

Publication date: 1982

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273094

zbMATH Keywords

cut-eliminationfine structure relationsrestricted forms of the omega-ruletransfinite progressions of theories

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03F99)

Related Items (8)

Majorizing provably recursive functions in fragments of PA ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ Provably true sentences across axiomatizations of Kripke's theory of truth ⋮ An implication of Gödel's incompleteness theorem. II: Not referring to the validity of oneself's assertion ⋮ A note on iterated consistency and infinite proofs ⋮ The scope of Gödel's first incompleteness theorem ⋮ Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule ⋮ REFLECTION RANKS AND ORDINAL ANALYSIS

Cites Work

• Systems of predicative analysis
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Unnamed Item

This page was built for publication: Iterated reflection principles and the ω-rule