Definability and decidability of binary predicates for time granularity

DOI10.1016/j.jal.2005.06.004zbMath1101.03016OpenAlexW2172904684MaRDI QIDQ2495389

Angelo Montanari, Guido Sciavicco, Adriano Peron, Massimo Franceschet

Publication date: 30 June 2006

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

Full work available at URL: https://doi.org/10.1016/j.jal.2005.06.004

zbMATH Keywords

decidabilitydefinabilitytime granularitymonadic theories

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Related Items (1)

On the relationships between theories of time granularity and the monadic second-order theory of one successor

Cites Work

• Synthesis, structure and power of systolic computations
• On interprocess communication. II: Algorithms
• Systolic tree \(\omega\)-languages: The operational and the logical view
• Branching within time: An expressively complete and elementarily decidable temporal logic for time granularity
• Decidability results for metric and layered temporal logics
• Extending Kamp's Theorem to Model Time Granularity
• Monadic second order definable relations on the binary tree
• Theories of  -layered metric temporal structures: expressiveness and decidability
• The taming (timing) of the states
• Temporalized logics and automata for time granularity
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Definability and decidability of binary predicates for time granularity