Weaker D-Complete Logics

Logic Journal of the IGPL 4 (2):215-225 (1996)
  Copy   BIBTEX

Abstract

BB′IW logic (or T→ is known to be D-complete. This paper shows that there are infinitely many weaker D-complete logics and it also examines how certain D-incomplete logics can be made complete by altering their axioms using simple substitutions

Links

PhilArchive



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

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

The D-Completeness of T→.R. K. Meyer & M. W. Bunder - 2011 - Australasian Journal of Logic 8:1-8.
Hybrid logics of separation axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
Hereditarily structurally complete modal logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.
Modal incompleteness revisited.Tadeusz Litak - 2004 - Studia Logica 76 (3):329 - 342.
Canonicity for intensional logics without iterative axioms.Timothy J. Surendonk - 1997 - Journal of Philosophical Logic 26 (4):391-409.
Kripke-style semantics for many-valued logics.Franco Montagna & Lorenzo Sacchetti - 2003 - Mathematical Logic Quarterly 49 (6):629.
Logics of belief change without linearity.John Cantwell - 2000 - Journal of Symbolic Logic 65 (4):1556-1575.
The Power of a Propositional Constant.Robert Goldblatt & Tomasz Kowalski - 2012 - Journal of Philosophical Logic (1):1-20.
Classically complete modal relevant logics.Edwin D. Mares - 1993 - Mathematical Logic Quarterly 39 (1):165-177.
A theory of hypermodal logics: Mode shifting in modal logic. [REVIEW]D. M. Gabbay - 2002 - Journal of Philosophical Logic 31 (3):211-243.

Analytics

Added to PP
2015-02-04

Downloads
19 (#793,504)

6 months
10 (#261,437)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Finitely Axiomatized Formalization of Predicate Calculus with Equality.Norman D. Megill - 1995 - Notre Dame Journal of Formal Logic 36 (3):435-453.

Add more citations

References found in this work

Principal type-schemes and condensed detachment.J. Roger Hindley & David Meredith - 1990 - Journal of Symbolic Logic 55 (1):90-105.
Condensed detachment as a rule of inference.J. A. Kalman - 1983 - Studia Logica 42 (4):443 - 451.
A simplified form of condensed detachment.M. W. Bunder - 1995 - Journal of Logic, Language and Information 4 (2):169-173.

Add more references