Combinator logics

Studia Logica 76 (1):17 - 66 (2004)
  Copy   BIBTEX

Abstract

Combinator logics are a broad family of substructual logics that are formed by extending the basic relevant logic B with axioms that correspond closely to the reduction rules of proper combinators in combinatory logic. In the Routley-Meyer relational semantics for relevant logic each such combinator logic is characterized by the class of frames that meet a first-order condition that also directly corresponds to the same combinator's reduction rule. A second family of logics is also introduced that extends B with the addition of propositional constants that correspond to combinators. These are characterized by relational frames that meet first-order conditions that reflect the structures of the combinators themselves.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
54 (#395,228)

6 months
9 (#455,691)

Historical graph of downloads
How can I increase my downloads?

References found in this work

The semantics of entailment — III.Richard Routley & Robert K. Meyer - 1972 - Journal of Philosophical Logic 1 (2):192 - 208.
Relevant Logics.Edwin D. Mares & Robert K. Meyer - 2001 - In Lou Goble (ed.), The Blackwell Guide to Philosophical Logic. Malden, Mass.: Wiley-Blackwell. pp. 280–308.
The Semantics of Entailment Omega.Yoko Motohama, Robert K. Meyer & Mariangiola Dezani-Ciancaglini - 2002 - Notre Dame Journal of Formal Logic 43 (3):129-145.

Add more references