The degree of the set of sentences of predicate provability logic that are true under every interpretation

DOI10.2307/2273871zbMath0632.03016OpenAlexW2049797799MaRDI QIDQ3768873

Vann McGee, George Boolos

Publication date: 1987

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273871

zbMATH Keywords

arithmeticinterpretationquantifier-eliminationpredicate modal provability logicquantified modal provability logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items (10)

Franco Montagna's work on provability logic and many-valued logic ⋮ On the degrees of unsolvability of modal predicate logics of provability ⋮ Finite Kripke models and predicate logics of provability ⋮ On first-order theories with provability operator ⋮ AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ Predicate provability logic with non-modalized quantifiers ⋮ The complexity of the modal predicate logic of “true in every transitive model of ZF” ⋮ Decidable and enumerable predicate logics of provability ⋮ Predicate Logics of Constructive Arithmetical Theories ⋮ In Memoriam: George Stephen Boolos 1940–1996

Cites Work

• Provability interpretations of modal logic

This page was built for publication: The degree of the set of sentences of predicate provability logic that are true under every interpretation