Axiomatisation and decidability off andp in cyclical time

Journal of Philosophical Logic 23 (2):197 - 224 (1994)
We present a Hilbert style axiomatisation for the set of formulas in the temporal language with F and P which are valid over non-transitive cyclical flows of time. We also give a simpler axiomatisation using the slightly controversial 'irreflexivity rule' and go on to prove the decidability of any temporal logic over cyclical time provided it uses only connectives with first-order tables
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01050343
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,651
External links
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

View all 6 references / Add more references

Citations of this work BETA
Ulrich Meyer (2015). Tense Logic. Philosophy Compass 10 (6):406-419.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

18 ( #254,083 of 1,902,709 )

Recent downloads (6 months)

5 ( #192,369 of 1,902,709 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.