The D-Completeness of T→

Australasian Journal of Logic 8:1-8 (2011)
  Copy   BIBTEX

Abstract

A Hilbert-style version of an implicational logic can be represented by a set of axiom schemes and modus ponens or by the corresponding axioms, modus ponens and substitution. Certain logics, for example the intuitionistic implicational logic, can also be represented by axioms and the rule of condensed detachment, which combines modus ponens with a minimal form of substitution. Such logics, for example intuitionistic implicational logic, are said to be D-complete. For certain weaker logics, the version based on condensed detachment and axioms is weaker than the original. In this paper we prove that the relevant logic T[→], and any logic of which this is a sublogic, is D-complete

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,168

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

Completeness of implicational relevant logics.R. Kashima - 2000 - Logic Journal of the IGPL 8 (6):761-785.
The shortest possible length of the longest implicational axiom.Dolph Ulrich - 1996 - Journal of Philosophical Logic 25 (1):101 - 108.
Deduction theorems for weak implicational logics.M. W. Bunder - 1982 - Studia Logica 41 (2-3):95 - 108.
Weaker D-Complete Logics.Norman Megill & Martin Bunder - 1996 - Logic Journal of the IGPL 4 (2):215-225.
Ternary relations and relevant semantics.Robert K. Meyer - 2004 - Annals of Pure and Applied Logic 127 (1-3):195-217.
Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.

Analytics

Added to PP
2015-02-04

Downloads
14 (#732,570)

6 months
1 (#448,551)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A simplified form of condensed detachment.M. W. Bunder - 1995 - Journal of Logic, Language and Information 4 (2):169-173.

Add more references