A logic of hypothetical conjunction

Matthew Collinson* (Corresponding Author)

*Corresponding author for this work

Research output: Contribution to journalArticle

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.logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including to generalized forms of resource reasoning of use in computer science applications.
Original languageEnglish
Pages (from-to)975–1009
Number of pages35
JournalJournal of Logic and Computation
Volume29
Issue number6
Early online date19 Nov 2019
DOIs
Publication statusPublished - 2019

Fingerprint

Semantics
Logic
Computer science
Computer Science
Reasoning
Resources
Binary relation
Connectives
Ternary
Fusion
Fusion reactions
Binary
Form

Cite this

A logic of hypothetical conjunction. / Collinson, Matthew (Corresponding Author).

In: Journal of Logic and Computation, Vol. 29, No. 6, 2019, p. 975–1009.

Research output: Contribution to journalArticle

@article{e17671fb7b2145e38ef78d6b672a1d0d,
title = "A logic of hypothetical conjunction",
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.logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including to generalized forms of resource reasoning of use in computer science applications.",
author = "Matthew Collinson",
note = "This work was supported by the UK Engineering and Physical Sciences Research Council under the research grants EP/K033042/1 and EP/P011829/1.",
year = "2019",
doi = "10.1093/logcom/exz018",
language = "English",
volume = "29",
pages = "975–1009",
journal = "Journal of Logic and Computation",
issn = "0955-792X",
publisher = "Oxford University Press",
number = "6",

}

TY - JOUR

T1 - A logic of hypothetical conjunction

AU - Collinson, Matthew

N1 - This work was supported by the UK Engineering and Physical Sciences Research Council under the research grants EP/K033042/1 and EP/P011829/1.

PY - 2019

Y1 - 2019

N2 - 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.logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including to generalized forms of resource reasoning of use in computer science applications.

AB - 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.logics, and therefore subsumes a number of other forms of conjunction. A number of applications of the hypothetical conjunction connective are discussed, including to generalized forms of resource reasoning of use in computer science applications.

U2 - 10.1093/logcom/exz018

DO - 10.1093/logcom/exz018

M3 - Article

VL - 29

SP - 975

EP - 1009

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

SN - 0955-792X

IS - 6

ER -