A new principle in the interpretability logic of all reasonable arithmetical theories

DOI10.1093/jigpal/jzp082zbMath1228.03040arXiv2004.06902OpenAlexW1983227357WikidataQ120204575 ScholiaQ120204575MaRDI QIDQ3081234

Joost J. Joosten, Evan Goris

Publication date: 7 March 2011

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

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

zbMATH Keywords

modal logicsdefinable cutsmodal incompletenessgeneralized Veltman semanticsinterpretability logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Related Items (10)

Franco Montagna's work on provability logic and many-valued logic ⋮ On the share of closed \(\mathsf {IL}\) formulas which are also in \(\mathsf {GL}\) ⋮ Theory and application of labelling techniques for interpretability logics ⋮ Bisimulations and bisimulation games between Verbrugge models ⋮ TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES ⋮ Provability and interpretability logics with restricted realizations ⋮ Reflection calculus and conservativity spectra ⋮ INTERPRETABILITY LOGICS AND GENERALISED VELTMAN SEMANTICS ⋮ Filtrations of generalized Veltman models ⋮ Interpretability in PRA

This page was built for publication: A new principle in the interpretability logic of all reasonable arithmetical theories