A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic

DOI10.1093/logcom/exi038zbMath1080.03038OpenAlexW2155188310WikidataQ120204356 ScholiaQ120204356MaRDI QIDQ5696302

Marco Robert Vervoort, Joost J. Joosten, Lev D. Beklemishev

Publication date: 18 October 2005

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/26754

zbMATH Keywords

omega-ruletransfinite inductionreflection principlepolymodal provability logicepsilon-zerofinitary methodproof-theoretic analysis of Peano arithmeticsystem of ordinal notations

Mathematics Subject Classification ID

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

Related Items

The Henkin Sentence, Models of transfinite provability logic, Transductions in arithmetic, Linear $ \mathrm{GLP}$-algebras and their elementary theories, Kripke semantics for provability logic GLP, Provability and interpretability logics with restricted realizations, On the positive fragment of the polymodal provability logic GLP, Reflection calculus and conservativity spectra, On provability logics with linearly ordered modalities, On the complexity of the closed fragment of Japaridze's provability logic, Turing-Taylor expansions for arithmetic theories, Topological Interpretations of Provability Logic