Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A logic for temporal conditionals and a solution to the Sea Battle Puzzle
School of Philosophy, Beijing Normal University.
Institute for Logic, Language and Computation, University of Amsterdam.
2018 (English)In: Proceedings of the 12th International Conference on Advances in Modal Logic (AiML'2018), London, 2018, p. 379---398Conference paper, Published paper (Refereed)
Abstract [en]

Temporal reasoning with conditionals is more complex than both classical temporal reasoning and reasoning with timeless conditionals, and can lead to some rather counter-intuitive conclusions. For instance, Aristotle’s famous “Sea Battle Tomorrow” puzzle leads to a fatalistic conclusion: whether there will be a sea battle tomorrow or not, but that is necessarily the case now. We propose a branching-time logic LTC to formalise reasoning about temporal conditionals and provide that logic with adequate formal semantics. The logic LTC extends the Nexttime fragment of CTL∗ , with operators for model updates, restricting the domain to only future moments where antecedent is still possible to satisfy. We provide formal semantics for these operators that implements the restrictor interpretation of antecedents of temporalized conditionals, by suitably restricting the domain of discourse. As a motivating example, we demonstrate that a naturally formalised in our logic version of the ‘Sea Battle’ argument renders it unsound, thereby providing a solution to the problem with fatalist conclusion that it entails, because its underlying reasoning per cases argument no longer applies when these cases are treated not as material implications but as temporal conditionals. On the technical side, we analyze the semantics of LTC and provide a series of reductions of LTC-formulae, first recursively eliminating the dynamic update operators and then the path quantifiers in such formulae. Using these reductions we obtain a sound and complete axiomatization for LTC, and reduce its decision problem to that of the modal logic KD.

Place, publisher, year, edition, pages
London, 2018. p. 379---398
Series
Advances in Modal Logic ; 12
Keywords [en]
conditionals, temporal logic, restrictors, Sea Battle Puzzle
National Category
Algebra and Logic
Identifiers
URN: urn:nbn:se:su:diva-164751ISBN: 978-1-84890-255-8 (print)OAI: oai:DiVA.org:su-164751DiVA, id: diva2:1280116
Conference
12th International Conference on Advances in Modal Logic (AiML'2018)
Funder
Swedish Research Council, 2015-04388Available from: 2019-01-17 Created: 2019-01-17 Last updated: 2019-01-17

Open Access in DiVA

No full text in DiVA

Other links

http://www.collegepublications.co.uk/aiml/?00009
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 4 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf