The omega-rule interpretation of transfinite provability logic

  title={The omega-rule interpretation of transfinite provability logic},
  author={David Fern{\'a}ndez-Duque and Joost J. Joosten},
  journal={Ann. Pure Appl. Log.},

Figures from this paper

A pr 2 01 7 Impredicative consistency and reflection

Given a set X of natural numbers, we may formalize “The formula φ is a theorem of ω-logic over the theory T using an oracle for X” by an expression [I|X ]Tφ, defined using a least fixed point in the

Quantified Reflection Calculus with One Modality

The first steps towards arithmetical completeness are taken by providing relational semantics for QRC$_1$ with a corresponding completeness proof and showing the finite model property, which implies decidability.

The Logic of Turing Progressions

This paper presents a logic that generates exactly all relations that hold between these different Turing progressions given a particular set of natural consistency notions, and is proven to arithmetically sound and complete for a natural interpretation.

A Self-contained Provability Calculus for Γ0

Since the order between these notations can be established in terms of derivability within the calculus, the inferences in this system can be carried out without using any external property of ordinals.

Hyperarithmetical Worm Battles

It is shown that indeed the natural transfinite extension of GLP is sound for this interpretation, and yields independent combinatorial principles for the second order theory ACA of arithmetical comprehension with full induction.

Arithmetical and Hyperarithmetical Worm Battles

. Japaridze’s provability logic GLP has one modality [ n ] for each natural number and has been used by Beklemishev for a proof theoretic analysis of Peano aritmetic ( PA ) and related theories.


  • J. Joosten
  • Computer Science, Mathematics
    The Journal of Symbolic Logic
  • 2021
The paper exploits the fact that provability is complete and that similar results hold for stronger provability notions, and proves soundness and completeness for the proposed interpretation for a wide class of theories, namely for any theory that can formalise the recursion described above and that has some further very natural properties.

Derived topologies on ordinals and stationary reflection

  • J. Bagaria
  • Mathematics
    Transactions of the American Mathematical Society
  • 2018
We study the transfinite sequence of topologies on the ordinal numbers that is obtained through successive closure under Cantor’s derivative operator on sets of ordinals, starting form the usual

Topological Completeness of the Transfinite Provability Logic

Let $\Lambda$ be an ordinal. The polymodal provability logic GLP$_\Lambda$ contains modalities $\langle\lambda\rangle$ for $\lambda < \Lambda$ intended to capture progressively stronger notions of



On Provability Logics with Linearly Ordered Modalities

A reduction of Japaridze’s polymodal provability logic GLPω is provided, yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLPΛ and the decidability of GLpΛ for recursive orderings Λ.

The polytopologies of transfinite provability logic

This paper generalizes Beklemishev and Gabelaia’s result to GLPΛ for countable Λ and introduces provability ambiances, which are topological models where valuations of formulas are restricted.

The Analytical Completeness of Dzhaparidze's Polymodal Logics

On strong provability predicates and the associated modal logics

Some further modal properties of Dzhaparidze's logic are proved, e.g., the fixed point property and the Craig interpolation lemma and other examples of the strong provability predicates and their applications.

Provability interpretations of modal logic

We consider interpretations of modal logic in Peano arithmetic (P) determined by an assignment of a sentencev* ofP to each propositional variablev. We put (⊥)*=“0 = 1”, (χ → ψ)* = “χ* → ψ*” and let

Models of transfinite provability logic

This paper shows how to extend constructions for arbitrary Λ to build a Kripke model and a topological model, and shows that is sound for both of these structures, as well as complete, provided Θ is large enough.

Provability algebras and proof-theoretic ordinals, I

Kripke Models of Transfinite Provability Logic

This paper shows how to extend polymodal logic constructions for arbitrary Λ and builds a Kripke model IΛ and shows that GLP 0 Λ is sound for this structure.

Kripke semantics for provability logic GLP

A simplified proof of arithmetical completeness theorem for provability logic GLP

We present a simplified proof of Japaridze’s arithmetical completeness theorem for the well-known polymodal provability logic GLP. The simplification is achieved by employing a fragment J of GLP that