The amazing mixed polynomial closure and its applications to two-variable first-order logic

DOI10.1145/3531130.3532410MaRDI QIDQ6649443

Publication date: 6 December 2024

separation two-variable first-order logic polynomial closure quantifier alternation deterministic hierarchies

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On the lattice of sub-pseudovarieties of DA.
Locally trivial categories and unambiguous concatenation
Classifying regular events in symbolic logic
Languages and scanners
Regular languages in \(NC\)
Sur le produit de concatenation non ambigu
The join of the pseudovarieties of \(\mathcal R\)-trivial and \(\mathcal L\)-trivial monoids
The lattice of pseudovarieties of idempotent semigroups and a non-regular analogue
Abelian pointlikes of a monoid
Characterizing level one in group-based concatenation hierarchies
Generic results for concatenation hierarchies
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
On logical hierarchies within \(\mathrm{FO}^{2}\)-definable languages
The Join Levels of the Trotter-Weil Hierarchy Are Decidable
Alternation Hierarchies of First Order Logic with Regular Predicates
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
Two-variable first order logic with modular predicates over words
Adding Successor
Separating Without Any Ambiguity.
On All Things Star-Free
An Explicit Formula for the Intersection of Two Polynomials of Regular Languages
Efficient Separability of Regular Languages by Subsequences and Suffixes
On finite monoids having only trivial subgroups
Conelikes and ranker comparisons

This page was built for publication: The amazing mixed polynomial closure and its applications to two-variable first-order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649443)