D-complete Single Axioms for the Equivalential Calculus with the rules D and R

Bulletin of the Section of Logic 53 (4):479-489 (2024)
  Copy   BIBTEX

Abstract

Ulrich showed that most of the known axiomatisations of the classical equivalence calculus (EC) are D-incomplete, that is, they are not complete with the condensed detachment rule (D) as the primary rule of the proof procedure. He proved that the axiomatisation EEpEqrErEqp, EEEpppp by Wajsberg is D-complete and pointed out a number of D-complete single axioms, including one organic single axiom. In this paper we present new single axioms for EC with the condensed detachment and the reversed condensed detachment rules that form D-complete bases and are organic.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,518

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

Analytics

Added to PP
2024-11-07

Downloads
8 (#1,589,825)

6 months
8 (#622,456)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Marcin Czakon
Catholic University of Lublin

Citations of this work

No citations found.

Add more citations

References found in this work

A Machine-Oriented Logic based on the Resolution Principle.J. A. Robinson - 1966 - Journal of Symbolic Logic 31 (3):515-516.
Basic Propositional Calculus I.Mohammad Ardeshir & Wim Ruitenburg - 1998 - Mathematical Logic Quarterly 44 (3):317-343.
Bounded distributive lattices with strict implication.Sergio Celani & Ramon Jansana - 2005 - Mathematical Logic Quarterly 51 (3):219-246.

View all 16 references / Add more references