Feferman-vaught decompositions for prefix classes of first order logic
DOI10.1007/s10849-022-09384-9arXiv2112.15064OpenAlexW4309081345MaRDI QIDQ6117143
Publication date: 16 August 2023
Published in: Journal of Logic, Language and Information (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.15064
Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Model theory of finite structures (03C13) Graph representations (geometric and intersection representations, etc.) (05C62) Properties of classes of models (03C52) Interpolation, preservation, definability (03C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the size of prenex normal forms
- Data exchange: semantics and query answering
- Algorithmic uses of the Feferman-Vaught theorem
- Elements of finite model theory.
- Deciding effectively propositional logic using DPLL and substitution sets
- \(k\)-NLC graphs and polynomial algorithms
- The complexity of first-order and monadic second-order logic revisited
- Linear time solvable optimization problems on graphs of bounded clique-width
- The first order properties of products of algebraic systems
- Preservation and decomposition theorems for bounded degree structures
- Subclasses of presburger arithmetic and the weak EXP hierarchy
- A Feferman-Vaught Decomposition Theorem for Weighted MSO Logic.
- Where First-Order and Monadic Second-Order Logic Coincide
- Presburger arithmetic with bounded quantifier alternation
- Model Theory Makes Formulas Large
- On direct products of theories
- The Complexity of Decomposing Modal and First-Order Theories
This page was built for publication: Feferman-vaught decompositions for prefix classes of first order logic
