On first-order theories with provability operator

DOI10.2307/2275696zbMath0860.03016OpenAlexW2127066753MaRDI QIDQ4323033

Franco Montagna, Sergej N. Artemov

Publication date: 13 February 1995

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

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

zbMATH Keywords

Peano arithmeticprovability logicfirst-order theoriesPresburger arithmeticSkolem arithmeticpartial consistencyprovability operatorprovability extension of a theory

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items

Obituary: Franco Montagna (1948--2015) ⋮ Explicit Provability and Constructive Semantics ⋮ Predicate logics of expressively strong theories

Cites Work

• The predicate modal logic of provability
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Self-reference and modal logic
• ON MODAL LOGICS AXIOMATIZING PROVABILITY
• The degree of the set of sentences of predicate provability logic that are true under every interpretation
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On first-order theories with provability operator