A calculus for the common rules of ∧ and ∨

Studia Logica 48 (4):531-537 (1989)
  Copy   BIBTEX

Abstract

We provide a finite axiomatization of the consequence , i.e. of the set of common sequential rules for and . Moreover, we show that has no proper non-trivial strengthenings other than and . A similar result is true for , but not, e.g., for +.

Links

PhilArchive



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

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
2009-01-28

Downloads
24 (#617,476)

6 months
3 (#880,460)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Sentence connectives in formal logic.Lloyd Humberstone - forthcoming - Stanford Encyclopedia of Philosophy.
Replacement in Logic.Lloyd Humberstone - 2013 - Journal of Philosophical Logic 42 (1):49-89.
Aggregation and idempotence.Lloyd Humberstone - 2013 - Review of Symbolic Logic 6 (4):680-708.
Negation by iteration.I. L. Humberstone - 1995 - Theoria 61 (1):1-24.
Investigations into a left-structural right-substructural sequent calculus.Lloyd Humberstone - 2007 - Journal of Logic, Language and Information 16 (2):141-171.

View all 8 citations / Add more citations

References found in this work

2-element matrices.Wolfgang Rautenberg - 1981 - Studia Logica 40 (4):315 - 353.

Add more references