scientific article; zbMATH DE number 1775408
From MaRDI portal
Publication:4542541
zbMATH Open1027.68614MaRDI QIDQ4542541FDOQ4542541
Authors: Denis Thérien, Thomas Wilke
Publication date: 17 September 2002
Title of this publication is not available (Why is that?)
Recommendations
- On FO 2 Quantifier Alternation over Words
- Quantifier alternation in two-variable first-order logic with successor is decidable
- Level two of the quantifier alternation hierarchy over infinite words
- Level Two of the Quantifier Alternation Hierarchy over Infinite Words
- One variable is not enough for defining relation algebras, but two are
- Mathematical Foundations of Computer Science 2005
- [[:Publication:1118407|The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^Template:\mathcal L=A\Pi_ 2^Template:\mathcal L\)]]
- Two-variable first order logic with counting quantifiers: complexity results
- scientific article; zbMATH DE number 4024792
- Quantifier elimination for the reals with a predicate for the powers of two
Cited In (35)
- Linear circuits, two-variable logic and weakly blocked monoids
- One quantifier alternation in first-order logic with modular predicates
- Fragments of first-order logic over infinite words
- Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
- Title not available (Why is that?)
- The complexity of intersecting finite automata having few final states
- All about unambiguous polynomial closure
- Characterization of Logics over Ranked Tree Languages
- Separating regular languages with two quantifier alternations
- On the lattice of sub-pseudovarieties of DA.
- Two variable vs. linear temporal logic in model checking and games
- Regular languages of thin trees
- Covering and separation for logical fragments with modular predicates
- The word problem for omega-terms over the Trotter-Weil hierarchy
- Varieties
- Forbidden Patterns for FO2 Alternation Over Finite and Infinite Words
- Unary and two-variable interval logics
- Separating Without Any Ambiguity.
- A Trichotomy for Regular Trail Queries
- The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
- The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy
- First-order logic with two variables and unary temporal logic
- Locality and Centrality: The Variety ZG
- Alternation hierarchies of first order logic with regular predicates
- Title not available (Why is that?)
- Linear completeness thresholds for bounded model checking
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
- The regular languages of first-order logic with one alternation
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
- Conelikes and ranker comparisons
- How many times do you need to go back to the future in unary temporal logic?
- Partially ordered two-way Büchi automata
- The covering problem
- Two variable vs. linear temporal logic in model checking and games
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542541)