Denumerably Many Post-Complete Normal Modal Logics with Propositional Constants

Notre Dame Journal of Formal Logic 53 (4):549-556 (2012)
  Copy   BIBTEX

Abstract

We show that there are denumerably many Post-complete normal modal logics in the language which includes an additional propositional constant. This contrasts with the case when there is no such constant present, for which it is well known that there are only two such logics.

Categories

Keywords

Reprint years

DOI

10.1215/00294527-1722746

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

External links

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

Through your library

My notes

Similar books and articles

The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
Completeness and decidability results for some propositional modal logics containing “actually” operators.Dominic Gregory - 2001 - Journal of Philosophical Logic 30 (1):57-78.
Modal Extensions of Sub-classical Logics for Recovering Classical Logic.Marcelo E. Coniglio & Newton M. Peron - 2013 - Logica Universalis 7 (1):71-86.
Simulation and transfer results in modal logic – a survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
A loop-free decision procedure for modal propositional logics k4, s4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.
Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
Independent propositional modal logics.S. K. Thomason - 1980 - Studia Logica 39 (2-3):143 - 144.
Modal logic with names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
Hereditarily structurally complete modal logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.
Incompleteness and the Barcan formula.M. J. Cresswell - 1995 - Journal of Philosophical Logic 24 (4):379 - 403.
Generic generalized Rosser fixed points.Dick H. J. Jongh & Franco Montagna - 1987 - Studia Logica 46 (2):193 - 203.
Elementary definability and completeness in general and positive modal logic.Ernst Zimmermann - 2003 - Journal of Logic, Language and Information 12 (1):99-117.
Normal monomodal logics can simulate all others.Marcus Kracht & Frank Wolter - 1999 - Journal of Symbolic Logic 64 (1):99-138.
Cut-free tableau calculi for some propositional normal modal logics.Martin Amerbauer - 1996 - Studia Logica 57 (2-3):359 - 372.

Analytics

Added to PP
2012-11-09

Downloads
30 (#548,002)

6 months
4 (#855,130)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Rohan French
University of California, Davis

Citations of this work

The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2014 - Journal of Philosophical Logic 43 (1):133-152.
The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
Note on Extending Congruential Modal Logics.Lloyd Humberstone - 2016 - Notre Dame Journal of Formal Logic 57 (1):95-103.
An observation concerning porte's rule in modal logic.Rohan French & Lloyd Humberstone - 2015 - Bulletin of the Section of Logic 44 (1/2):25-31.

Add more citations

References found in this work

Contra-classical logics.Lloyd Humberstone - 2000 - Australasian Journal of Philosophy 78 (4):438 – 474.
Post completeness in modal logic.Krister Segerberg - 1972 - Journal of Symbolic Logic 37 (4):711-715.
Continuum Many Maximal Consistent Normal Bimodal Logics with Inverses.Timothy Williamson - 1998 - Notre Dame Journal of Formal Logic 39 (1):128-134.

View all 9 references / Add more references