scientific article; zbMATH DE number 7278084
From MaRDI portal
Publication:5136301
DOI10.4230/LIPIcs.FSTTCS.2017.12zbMath1491.68127arXiv1710.05582MaRDI QIDQ5136301
Bartosz Bednarczyk, Witold Charatonik
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.05582
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Logic in computer science (03B70) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- On the complexity of the two-variable guarded fragment with transitive guards
- Modulo-counting quantifiers over finite trees
- Domino-tiling games
- Counting modulo quantifiers on finite structures
- Regular languages defined with generalized quantifiers
- Two-variable first order logic with counting quantifiers: complexity results
- First-order logic with two variables and unary temporal logic
- Expressive Completeness for LTL With Modulo Counting and Group Quantifiers
- Regular tree languages definable in FO and in FO mod
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Non-definability of Languages by Generalized First-order Formulas over (N,+)
- Hanf normal form for first-order logic with unary counting quantifiers
- Extending Two-Variable Logic on Trees
- Complexity of Two-Variable Logic on Finite Trees
- Two-variable Logic with Counting and a Linear Order
- Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
This page was built for publication:
