Relevance via decomposition: A project, some results, an open question

Makinson, David C. (2017) Relevance via decomposition: A project, some results, an open question. Australasian Journal of Philosophy, 14 (3). ISSN 0004-8402

Preview

Text - Published Version Download (555kB) | Preview

• Publisher

Abstract

We report on progress and an unsolved problem in our attempt to obtain a clear rationale for relevance logic via semantic decomposition trees. Suitable decomposition rules, constrained by a natural parity condition, generate a set of directly acceptable formulae that contains all axioms of the well-known system R, is closed under substitution and conjunction, satisfies the letter-sharing condition, but is not closed under detachment. To extend it, a natural recursion is built into the ocedure for constructing decomposition trees. The resulting set of acceptable formulae has many attractive features, but it remains an open question whether it continues to satisfy the crucial letter-sharing condition.

Item Type:	Article
Official URL:	https://aap.org.au/AJP
Additional Information:	© 2017 Taylor & Francis on behalf of the Australasian Association of Philosophy
Divisions:	CPNSS
Subjects:	H Social Sciences > H Social Sciences (General)
Date Deposited:	10 Oct 2017 14:30
Last Modified:	12 Dec 2024 01:33
URI:	http://eprints.lse.ac.uk/id/eprint/84554

Actions (login required)

View Item