A Proof System for Classical Logic

Studia Logica 80 (1):95-104 (2005)
  Copy   BIBTEX

Abstract

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

Links

PhilArchive



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

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

A proof–theoretic study of the correspondence of hybrid logic and classical logic.H. Kushida & M. Okada - 2006 - Journal of Logic, Language and Information 16 (1):35-61.
Efficient Inverse Tableaux.Marco Mondadori - 1995 - Logic Journal of the IGPL 3 (6):939-953.
Rasiowa-Sikorski proof system for the non-Fregean sentential logic SCI.Joanna Golinska-Pilarek - 2007 - Journal of Applied Non-Classical Logics 17 (4):509–517.
A lower bound for intuitionistic logic.Pavel Hrubeš - 2007 - Annals of Pure and Applied Logic 146 (1):72-90.
Implicational f-structures and implicational relevance logics.A. Avron - 2000 - Journal of Symbolic Logic 65 (2):788-802.
A Simplified System Of Sentential Logic.Michael Goodman - 2011 - Annales Philosophici 2:35-40.
Implicit Proofs.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (2):387 - 397.

Analytics

Added to PP
2009-01-28

Downloads
51 (#313,195)

6 months
6 (#526,916)

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

No references found.

Add more references