Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus

, &

Abstract

detail a question that, for a quarter of a century, remained open despite intense study by various researchers. Is the formula XC B = e(x e(e(e( ) e( )) z)) a single axiom for the classical equivalential calculus when the rules of inference consist..

Categories

Keywords

Reprint years

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

  • Only published works are available at libraries.

My notes

Similar books and articles

Vanquishing the XCB question: The methodological discovery of the last shortest single axiom for the equivalential calculus.Branden Fitelson - manuscript
A shortest single axiom for the classical equivalential calculus.John A. Kalman - 1978 - Notre Dame Journal of Formal Logic 19 (1):141-144.
Shortest Axiomatizations of Implicational S4 and S.Zachary Ernst, Branden Fitelson, Kenneth Harris & Larry Wos - 2002 - Notre Dame Journal of Formal Logic 43 (3):169-179.
Shortest single axioms for the classical equivalential calculus.Jeremy George Peterson - 1976 - Notre Dame Journal of Formal Logic 17 (2):267-271.
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.L. Wos, S. Winker, R. Veroff, B. Smith & L. Henschen - 1983 - Notre Dame Journal of Formal Logic 24 (2):205-223.
Finding missing proofs with automated reasoning.Branden Fitelson & Larry Wos - 2001 - Studia Logica 68 (3):329-356.
The shortest possible length of the longest implicational axiom.Dolph Ulrich - 1996 - Journal of Philosophical Logic 25 (1):101 - 108.
Independence of two nice sets of axioms for the propositional calculus.T. Thacher Robinson - 1968 - Journal of Symbolic Logic 33 (2):265-270.
Basic properties of the equivalence.Jacek K. Kabziński - 1982 - Studia Logica 41 (1):17-40.
Determined game logic is complete.Jan van Eijck - unknown
Characterizing equivalential and algebraizable logics by the Leibniz operator.Burghard Herrmann - 1997 - Studia Logica 58 (2):305-323.
On the intuitionistic equivalential calculus.Robert E. Tax - 1973 - Notre Dame Journal of Formal Logic 14 (4):448-456.

Analytics

Added to PP
2010-12-22

Downloads
39 (#388,687)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Branden Fitelson
Northeastern University

Citations of this work

Add more citations

References found in this work

No references found.

Add more references