Predicate provability logic with non-modalized quantifiers

Studia Logica 50 (1):149 - 160 (1991)
  Copy   BIBTEX


Predicate modal formulas with non-modalized quantifiers (call them Q-formulas) are considered as schemata of arithmetical formulas, where is interpreted as the provability predicate of some fixed correct extension T of arithmetic. A method of constructing 1) non-provable in T and 2) false arithmetical examples for Q-formulas by Kripke-like countermodels of certain type is given. Assuming the means of T to be strong enough to solve the (undecidable) problem of derivability in QGL, the Q-fragment of the predicate version of the logic GL, we prove the recursive enumerability of the sets of Q-formulas all arithmetical examples of which are: 1) T-provable, 2) true. In. particular, the first one is shown to be exactly QGL and the second one to be exactly the Q-fragment of the predicate version of Solovay's logic S.



    Upload a copy of this work     Papers currently archived: 89,654

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

32 (#426,146)

6 months
3 (#433,579)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The predicate modal logic of provability.Franco Montagna - 1984 - Notre Dame Journal of Formal Logic 25 (2):179-189.
Omega-consistency and the diamond.George Boolos - 1980 - Studia Logica 39 (2-3):237 - 243.

Add more references