scientific article; zbMATH DE number 7376060
From MaRDI portal
Publication:5002820
DOI10.4230/LIPIcs.ICALP.2018.133zbMath1499.03028MaRDI QIDQ5002820
Nicole Schweikardt, Dietrich Kuske
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite model theorymodulo-counting quantifiersGaifman localityfixed-parameter-tractable model checking
Specification and verification (program logics, model checking, etc.) (68Q60) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Basic properties of first-order languages and structures (03C07) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- An optimal construction of Hanf sentences
- Algorithmic uses of the Feferman-Vaught theorem
- Elements of finite model theory.
- Periodic sets of integers
- Counting modulo quantifiers on finite structures
- Tree acceptors and some of their applications
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Deciding first-order properties of locally tree-decomposable structures
- The first order properties of products of algebraic systems
- Easy problems for tree-decomposable graphs
- Preservation and decomposition theorems for bounded degree structures
- Hanf normal form for first-order logic with unary counting quantifiers
- Deciding First-Order Properties of Nowhere Dense Graphs
- Notions of locality and their logical characterizations over finite models
- An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
- Model Theory Makes Formulas Large
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
