The logic of Turing progressions
DOI10.1215/00294527-2019-0037zbMath1452.03132arXiv1604.08705OpenAlexW2754583891WikidataQ119882880 ScholiaQ119882880MaRDI QIDQ2176413
Joost J. Joosten, Eduardo Hermo Reyes
Publication date: 4 May 2020
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.08705
provability logicordinal analysispositive modal logicconservation resultsfragments of arithmeticTuring progressions
Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Proof theory in general (including proof-theoretic semantics) (03F03) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions
- Positive provability logic for uniform reflection principles
- Turing-Taylor expansions for arithmetic theories
- Provability logics for natural Turing progressions of arithmetical theories
- Proof-theoretic analysis by iterated reflection
- Provability algebras and proof-theoretic ordinals. I
- Iterated local reflection versus iterated consistency
- On the positive fragment of the polymodal provability logic GLP
- Reflection principles and provability algebras in formal arithmetic
- Relational Semantics for the Turing Schmerl Calculus
This page was built for publication: The logic of Turing progressions