First-order logic with two variables and unary temporal logic

From MaRDI portal
Publication:2506493

DOI10.1006/inco.2001.2953zbMath1096.03013OpenAlexW2131159347MaRDI QIDQ2506493

Moshe Y. Vardi, Thomas Wilke, Kousha Etessami

Publication date: 10 October 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.2953




Related Items (41)

Two-Variable Logic with Counting and TreesComplexity of Two-Variable Logic on Finite TreesSome modal aspects of XPathLARS: a logic-based framework for analytic reasoning over streamsUnnamed ItemNotes on logics of metric spacesTemporal BI: proof system, semantics and translationsSeparation logics and modalities: a surveyHow many times do you need to go back to the future in unary temporal logic?On the almighty wandOn the translation of automata to linear temporal logicPropositional interval neighborhood logics: expressiveness, decidability, and undecidable extensionsUnnamed ItemUnnamed ItemA SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDSCharacterization of Logics over Ranked Tree LanguagesComplexity of two-variable dependence logic and IF-logicSeparating Without Any Ambiguity.``Most of leads to undecidability: failure of adding frequencies to LTLA Note on C² Interpreted over Finite Data-WordsThe light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDTRelative expressive power of navigational querying on graphsComparing the succinctness of monadic query languages over finite treesFragments of first-order logic over infinite wordsOn Decidability of LTL+Past Model Checking for Process Rewrite SystemsUnnamed Item\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)From Philosophical to Industrial LogicsUnnamed ItemFrom Monadic Logic to PSLOn decidability of LTL model checking for process rewrite systemsOn Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic FreezingTwo Variable vs. Linear Temporal Logic in Model Checking and GamesExpressiveness of Hybrid Temporal Logic on Data WordsExpressive Completeness for LTL With Modulo Counting and Group QuantifiersUnnamed ItemModel Checking FO(R) over One-Counter Processes and beyondBounded linear-time temporal logic: a proof-theoretic investigationUnnamed ItemOne-Dimensional Logic over TreesAll finitely axiomatizable tense logics of linear time flows are coNP-complete



Cites Work


This page was built for publication: First-order logic with two variables and unary temporal logic