David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Temporal propositions are mapped to sets of strings that witness (in a precise sense) the propositions over discrete linear Kripke frames. The strings are collected into regular languages to ensure the decidability of entailments given by inclusions between languages. (Various notions of bounded entailment are shown to be expressible as language inclusions.) The languages unwind computations implicit in the logical (and temporal) connectives via a system of finite-state constraints adapted from finite-state morphology. Applications to Hybrid Logic and non-monotonic inertial reasoning are briefly considered.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.
Tim Fernando (2007). Observing Events and Situations in Time. Linguistics and Philosophy 30 (5):527-550.
Added to index2010-02-05
Total downloads3 ( #339,147 of 1,679,341 )
Recent downloads (6 months)1 ( #182,933 of 1,679,341 )
How can I increase my downloads?