Decidable and enumerable predicate logics of provability

DOI10.1007/BF00401550MaRDI QIDQ750418zbMATH OpenFDO

Authors Giorgie Dzhaparidze

Publication date 1990

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00401550

zbMATH Keywords

completenessdecidabilityenumerable fragmentspredicate modal logicprovability logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Gödel numberings and issues of incompleteness (03F40)

Review text

The predicate modal logic with \(\square\) interpreted as provability in some extension T of arithmetic is not recursively axiomatizable, and the set of true formulas is not arithmetic. The author finds enumerable fragments. A proof of decidability and completeness for formulas in one individual variable x is presented, where \(\forall x\) is interpreted as an S5-modality with additional axiom \(\square \forall A\to \forall \square A\). For provably \(\Pi_ 1\)-complete theories T the predicate version of K is complete for the predicate modal formulas of depth 1, and the predicate version of K4 is complete for the formulas \(\square^ n\perp \to A\) with arbitrary A. \(\Pi_ 1\)-completeness is used to describe inside T the construction of a model.

Cites work

• scientific article; zbMATH DE number 3635994 (Why is no real title available?)
• scientific article; zbMATH DE number 1110560 (Why is no real title available?)
• Provability interpretations of modal logic
• The degree of the set of sentences of predicate provability logic that are true under every interpretation

Cited in

(25)

• Predicate provability logic with non-modalized quantifiers
• Predicate logics of decidable fragments of arithmetic
• Finite Kripke models and predicate logics of provability
• scientific article; zbMATH DE number 3885864 (Why is no real title available?)
• Decidable Extensions of Hennessy-Milner Logic
• scientific article; zbMATH DE number 3976994 (Why is no real title available?)
• The degree of the set of sentences of predicate provability logic that are true under every interpretation
• scientific article; zbMATH DE number 4085609 (Why is no real title available?)
• scientific article; zbMATH DE number 4087630 (Why is no real title available?)
• Rosser Orderings in Bimodal Logics
• scientific article; zbMATH DE number 517064 (Why is no real title available?)
• On the degrees of unsolvability of modal predicate logics of provability
• On first-order theories with provability operator
• scientific article; zbMATH DE number 2020143 (Why is no real title available?)
• scientific article; zbMATH DE number 1859179 (Why is no real title available?)
• Recursive enumerability and elementary frame definability in predicate modal logic
• AI 2003: Advances in Artificial Intelligence
• scientific article; zbMATH DE number 4195937 (Why is no real title available?)
• scientific article; zbMATH DE number 4197983 (Why is no real title available?)
• Decidability and definability with circumscription
• MONADIC INTUITIONISTIC AND MODAL LOGICS ADMITTING PROVABILITY INTERPRETATIONS
• Arithmetical completeness theorems for monotonic modal logics
• Predicate counterparts of modal logics of provability: high undecidability and Kripke incompleteness
• The monadic Grzegorczyk logic
• On the decidability of open logic

This page was built for publication: Decidable and enumerable predicate logics of provability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q750418)