Well-orders in the transfinite Japaridze algebra

DOI10.1093/JIGPAL/JZU018MaRDI QIDQ4644499zbMATH OpenOpenAlexDBLPWikidataFDO

Authors David Fernández-Duque, Joost J. Joosten

Publication date 8 January 2019

Published in Logic Journal of the IGPL (Search for Journal in Brave)

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

zbMATH Keywords

provability logicsordinal notationsJaparidze algebrareflection calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other algebras related to logic (03G25) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Abstract: This paper studies the transfinite propositional provability logics $gl{p}_{L}ambda$ and their corresponding algebras. These logics have for each ordinal $xi<Lambda$ a modality $laalphaa$. We will focus on the closed fragment of $gl{p}_{L}ambda$ (i.e., where no propositional variables occur) and emph{worms} therein. Worms are iterated consistency expressions of the form $lax{i}_{n}aldotslax{i}_{1}aop$. Beklemishev has defined well-orderings ${<}_{x}i$ on worms whose modalities are all at least $xi$ and presented a calculus to compute the respective order-types. In the current paper we present a generalization of the original ${<}_{x}i$ orderings and provide a calculus for the corresponding generalized order-types $o_{x}i$. Our calculus is based on so-called {em hyperations} which are transfinite iterations of normal functions. Finally, we give two different characterizations of those sequences of ordinals which are of the form $la{formerOmega}_{x}i(A)a_{xiinord}$ for some worm $A$. One of these characterizations is in terms of a second kind of transfinite iteration called {em cohyperation.}

Recommendations

• The Worm Calculus
• On provability logics with linearly ordered modalities
• The omega-rule interpretation of transfinite provability logic
• scientific article; zbMATH DE number 6302903
• Models of transfinite provability logic

Cited in

(11)

• MÜNCHHAUSEN PROVABILITY
• \(J\)-adic filtration of orders with application to orders of finite representation type.
• Reflection algebras and conservation results for theories of iterated truth
• On provability logics with linearly ordered modalities
• Hyperarithmetical worm battles
• PREDICATIVITY THROUGH TRANSFINITE REFLECTION
• Deducibility and independence in Beklemishev's autonomous provability calculus
• Turing-Taylor expansions for arithmetic theories
• Hyperations, Veblen progressions and transfinite iteration of ordinal functions
• The polytopologies of transfinite provability logic
• Derived topologies on ordinals and stationary reflection

This page was built for publication: Well-orders in the transfinite Japaridze algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644499)