The analytical completeness of Dzhaparidze's polymodal logics

Annals of Pure and Applied Logic 61 (1-2):95-111 (1993)
  Copy   BIBTEX

Abstract

The bimodal provability logics of analysis for ordinary provability and provability by the ω-rule are shown to be fragments of certain ‘polymodal’ logics introduced by G.K. Dzhaparidze. In addition to modal axiom schemes expressing Löb's theorem for the two kinds of provability, the logics treated here contain a scheme expressing that if a statement is consistent, then the statement that it is consistent is provable by the ω-rule

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

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

Through your library

Similar books and articles

Normal monomodal logics can simulate all others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
Polymodal Lattices and Polymodal Logic.John L. Bell - 1996 - Mathematical Logic Quarterly 42 (1):219-233.
Structural Completeness in Fuzzy Logics.Petr Cintula & George Metcalfe - 2009 - Notre Dame Journal of Formal Logic 50 (2):153-182.
Reflexive Intermediate Propositional Logics.Nathan C. Carter - 2006 - Notre Dame Journal of Formal Logic 47 (1):39-62.
Kripke Completeness of Infinitary Predicate Multimodal Logics.Yoshihito Tanaka - 1999 - Notre Dame Journal of Formal Logic 40 (3):326-340.
Some kinds of modal completeness.J. F. A. K. Benthem - 1980 - Studia Logica 39 (2-3):125 - 141.
Duality and Completeness for US-Logics.Fabio Bellissima & Saverio Cittadini - 1998 - Notre Dame Journal of Formal Logic 39 (2):231-242.

Analytics

Added to PP
2014-01-16

Downloads
20 (#723,940)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.

Add more citations