Affiliation:
1. School of Natural and Computing Sciences, University of Aberdeen, Aberdeen AB24 3UE, United Kingdom
Abstract
Abstract
A binary connective that can be read as a matching conjunction for conditional connectives found in many conditional logics is considered. The most natural way to read this connective is often as a conjunction and yet, hypothetically, considered to hold of a state of affairs that could be obtained under the hypothesis. The connective can be given an intensional semantics extending a standard semantics of conditional logic that uses propositionally indexed families of binary relations on possible worlds. This semantics is determined by an adjoint relationship between the operations supporting the semantics of the conditional and the new conjunction. The semantics of the hypothetical conjunction connective subsumes the semantics, supported by a ternary relation semantics, of the fusion connective that arises in connection with substructural and relevant logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including generalized forms of resource reasoning used in computer science applications.
Funder
Engineering and Physical Sciences Research Council
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference30 articles.
1. Backward induction and common knowledge of rationality;Aumann;Games and Economic Behavior,1995
2. On the ternary relation and conditionality;Beall;Journal of Philosophical Logic,2012
3. Undecidability of propositional separation logic and its neighbours;Brotherston,2014
4. Basic conditional logic;Chellas;Journal of Philosophical Logic,1975
5. Modal Logic