Graduate studies at Western
Studia Logica 50 (1):149 - 160 (1991)
|Abstract||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.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Nobu-Yuki Suzuki (1995). Constructing a Continuum of Predicate Extensions of Each Intermediate Propositional Logic. Studia Logica 54 (2):173 - 198.
Greg Restall (2005). Logic: An Introduction. Routledge.
Petr Hájek (2001). Fuzzy Logic and Arithmetical Hierarchy III. Studia Logica 68 (1):129-142.
Petr Hájek (2002). Monadic Fuzzy Predicate Logics. Studia Logica 71 (2):165-175.
Robert Goldblatt (2011). Quantifiers, Propositions, and Identity: Admissible Semantics for Quantified Modal and Substructural Logics. Cambridge University Press.
Franco Montagna (2001). Three Complexity Problems in Quantified Fuzzy Logic. Studia Logica 68 (1):143-152.
Mitsunori Kobayashi & Arata Ishimoto (1982). A Propositional Fragment of Leśniewski's Ontology and its Formulation by the Tableau Method. Studia Logica 41 (2-3):181 - 195.
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 (1990). Decidable and Enumerable Predicate Logics of Provability. Studia Logica 49 (1):7 - 21.
Added to index2009-01-28
Total downloads2 ( #246,694 of 739,367 )
Recent downloads (6 months)1 ( #61,680 of 739,367 )
How can I increase my downloads?