Axiomatisation and decidability of \(F\) and \(P\) in cyclical time

DOI10.1007/BF01050343zbMath0796.03030MaRDI QIDQ1319266

M. A. Reynolds

Publication date: 12 April 1994

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

zbMATH Keywords

decidabilityirreflexivity ruleHilbert style axiomatisationnon-transitive cyclical flows of timetemporal language with \(F\) and \(P\)temporal logic over cyclical time

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (4)

Finite \(H\)-dimension does not imply expressive completeness ⋮ Cubulating hyperbolic free-by-cyclic groups: the irreducible case ⋮ Surface subgroups from linear programming ⋮ The Poisson boundary of \(\mathrm{Out}(F_N)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An axiomatization for until and since over the reals without the IRR rule
• Finite \(H\)-dimension does not imply expressive completeness
• The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
• An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
• Countable Homogeneous Tournaments
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The completeness of the first-order functional calculus

This page was built for publication: Axiomatisation and decidability of \(F\) and \(P\) in cyclical time