Javascript must be enabled to continue!
A logic of hypothetical conjunction
View through CrossRef
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.
Title: A logic of hypothetical conjunction
Description:
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.
Related Results
Epistemic extensions of substructural inquisitive logics
Epistemic extensions of substructural inquisitive logics
Abstract
In this paper, we study the epistemic extensions of distributive substructural inquisitive logics. Substructural inquisitive logics are logics of questions ...
Intuitionistic ancestral logic
Intuitionistic ancestral logic
Abstract
In this article we define pure intuitionistic Ancestral Logic ( iAL ), extending pure intuitionistic First-Order Logic ( iFOL ). This logic is a dependently...
A Logic for Desire Based on Causal Inference
A Logic for Desire Based on Causal Inference
Abstract
Reasoning about desire plays a significant role in logic, artificial intelligence and philosophy, etc. In this paper, we propose an interpretation of desire...
Two Informational Theories of Memory: a case from Memory-Conjunction Errors
Two Informational Theories of Memory: a case from Memory-Conjunction Errors
Abstract
The causal and simulation theories are often presented as very distinct views about declarative memory, their major difference lying on the causal condition...
The challenge of sustaining organizational hybridity: The role of power and agency
The challenge of sustaining organizational hybridity: The role of power and agency
Hybrid organizations harbor different and often conflicting institutional logics, thus facing the challenge of sustaining their hybridity. Crucial to overcoming this challenge is t...
Bridge Principles and Epistemic Norms
Bridge Principles and Epistemic Norms
AbstractIs logic normative for belief? A standard approach to answering this question has been to investigate bridge principles relating claims of logical consequence to norms for ...
Slow Fire: Serial Thinking and Hardy's Genres of Induction
Slow Fire: Serial Thinking and Hardy's Genres of Induction
This essay considers the use of “serial thinking”—an approach to representation and cognition that emphasizes repetition, enumeration, and aggregation—in the work of Thomas Hardy. ...
Dynamic epistemic logics for abstract argumentation
Dynamic epistemic logics for abstract argumentation
AbstractThis paper introduces a multi-agent dynamic epistemic logic for abstract argumentation. Its main motivation is to build a general framework for modelling the dynamics of a ...