Counterfactuals in Branching Time: The Weakest Solution
Daniil Khaitovich

TL;DR
This paper proposes a minimalistic approach combining Ockhamist branching time logic with a basic counterfactual logic to address key metaphysical issues in temporally sensitive counterfactuals.
Contribution
It introduces the weakest consistent formal framework for analyzing counterfactuals in branching time models, simplifying previous complex solutions.
Findings
Identifies key metaphysical problems in counterfactuals with time
Proposes a minimal logical framework combining branching time and counterfactual logic
Argues for the simplicity and effectiveness of the weakest solution
Abstract
In this paper, we present a formal analysis of temporally sensitive counterfactual conditionals. We observe a set of key metaphysical and conceptual problems in regards to counterfactual statements and time. Bearing that in mind, we present the weakest combination of Ockhamist branching time temporal logic and minimal counterfactual logic P and argue in favor of that simple solution.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Logic, programming, and type systems
