On classes of arithmetical counterparts of modal provability logics
A logic of provability \(\ell\) is defined as a modal logic which describes those principles of provability in Peano Arithmetic PA that can be demonstrated by means of a given theory T extending PA. In this situation T is called a counterpart of \(\ell\). Obviously, each logic of provability \(\ell\) has a smallest counterpart. The paper shows that a given logic of provability has a continuum of counterparts, each two of which are inconsistent. As a corollary we see that none of the logics of provability has a largest counterpart.
- scientific article; zbMATH DE number 4177049
- scientific article; zbMATH DE number 4099258
- scientific article; zbMATH DE number 4174895
- Uniform arithmetical completeness of modal provability logics
- scientific article; zbMATH DE number 1097010
- Arithmetical interpretations and Kripke frames of predicate modal logic of provability
- scientific article; zbMATH DE number 1989643
- Arithmetical completeness theorems for monotonic modal logics
- Syntactical results on the arithmetical completeness of modal logic
- Arithmetically complete modal theories
- The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- scientific article; zbMATH DE number 6680147 (Why is no real title available?)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- scientific article; zbMATH DE number 4145872 (Why is no real title available?)
- Positive Arithmetic Without Exchange Is a Subclassical Logic
- Remarks on natural minimal logics: A. Visser's basic and formal logics and their modal counterparts
This page was built for publication: On classes of arithmetical counterparts of modal provability logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922522)
