Two-variable first order logic with modular predicates over words
From MaRDI portal
Recommendations
- One quantifier alternation in first-order logic with modular predicates
- Regular languages defined by generalized first-order formulas with a bounded number of bound variables
- Two-variable logic with a between relation
- Two-variable first order logic with counting quantifiers: complexity results
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
Cited in
(16)- The regular languages of wire linear \(\mathrm{AC}^0\)
- Alternation hierarchies of first order logic with regular predicates
- Regular Languages Definable by Majority Quantifiers with Two Variables
- Two-variable logic with a between relation
- Tameness and the power of programs over monoids in \(\mathbf{DA}\)
- The power of programs over monoids in DA
- Two-variable logics with some betweenness relations: expressiveness, satisfiability and membership
- One quantifier alternation in first-order logic with modular predicates
- Covering and separation for logical fragments with modular predicates
- Automata, Languages and Programming
- All about unambiguous polynomial closure
- The amazing mixed polynomial closure and its applications to two-variable first-order logic
- A generic characterization of generalized unary temporal logic and two-variable first-order logic
- In orbit with MeSCaL: higher in concatenation and navigational hierarchies of regular languages
- A first taste of MeSCaL, a tool for solving membership problems for regular languages
- Closing star-free closure
This page was built for publication: Two-variable first order logic with modular predicates over words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957895)
