On elementary theories of ordinal notation systems based on reflection principles

DOI10.1134/S0081543815040124zbMath1373.03124arXiv1312.3002OpenAlexW2964204347MaRDI QIDQ281010

Fedor N. Pakhomov

Publication date: 10 May 2016

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.3002

zbMATH Keywords

decidabilityordinal notation systempolymodal provability logicreflection schemes

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Relative consistency and interpretations (03F25)

Related Items

Franco Montagna's work on provability logic and many-valued logic ⋮ Reflection calculus and conservativity spectra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof theory. The first step into impredicativity
• Proof theory. 2nd ed
• Wie die Beweistheorie zu ihren Ordinalzahlen kam und kommt
• Proof-theoretic analysis by iterated reflection
• The inverse limit space and the dynamics of a graph map
• Provability algebras and proof-theoretic ordinals. I
• A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
• Reflection principles and provability algebras in formal arithmetic
• Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
• All maps of type 2^{∞} are boundary maps
• Undecidability of the elementary theory of the semilattice of GLP-words
• On strong provability predicates and the associated modal logics
• Worms, gaps, and hydras
• Decision methods in the theory of ordinals
• The constructive second number class
• On notation for ordinal numbers