David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 49 (1):7 - 21 (1990)
Predicate modal formulas are considered as schemata of arithmetical formulas, where is interpreted as the standard formula of provability in a fixed sufficiently rich theory T in the language of arithmetic. QL T(T) and QL T are the sets of schemata of T-provable and true formulas, correspondingly. Solovay's well-known result — construction an arithmetical counterinterpretation by Kripke countermodel — is generalized on the predicate modal language; axiomatizations of the restrictions of QL T(T) and QL T by formulas, which contain no variables different from x, are given by means of decidable prepositional bimodal systems; under the assumption that T is 1-complete, there is established the enumerability of the restrictions of QL T(T) and QL T by: 1) formulas in which the domains of different occurrences of don't intersect and 2) formulas of the form n A.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
George Boolos & Vann McGee (1987). The Degree of the Set of Sentences of Predicate Provability Logic That Are True Under Every Interpretation. Journal of Symbolic Logic 52 (1):165-171.
Citations of this work BETA
No citations found.
Similar books and articles
Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
Douglas Cenzer & Jeffrey B. Remmel (2006). Complexity, Decidability and Completeness. Journal of Symbolic Logic 71 (2):399 - 424.
Tatsuya Shimura (1993). Kripke Completeness of Some Intermediate Predicate Logics with the Axiom of Constant Domain and a Variant of Canonical Formulas. Studia Logica 52 (1):23 - 40.
William C. Purdy (1996). Fluted Formulas and the Limits of Decidability. Journal of Symbolic Logic 61 (2):608-620.
Alessandro Berarducci (1990). The Interpretability Logic of Peano Arithmetic. Journal of Symbolic Logic 55 (3):1059-1089.
Lev D. Beklemishev (1996). Bimodal Logics for Extensions of Arithmetical Theories. Journal of Symbolic Logic 61 (1):91-124.
Frank Wolter & Michael Zakharyaschev (2001). Decidable Fragments of First-Order Modal Logics. Journal of Symbolic Logic 66 (3):1415-1438.
Konstantin N. Ignatiev (1993). On Strong Provability Predicates and the Associated Modal Logics. Journal of Symbolic Logic 58 (1):249-290.
Sergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #440,892 of 1,101,623 )
Recent downloads (6 months)1 ( #292,019 of 1,101,623 )
How can I increase my downloads?