When locality meets preservation

DOI10.1145/3531130.3532498MaRDI QIDQ6649481FDOQ6649481

Authors: Aliaume Lopez 

Publication date: 6 December 2024

Recommendations

• Preservation theorems in finite model theory
• Preservation under Extensions on Well-Behaved Finite Structures
• Automata, Languages and Programming
• Model Theory Makes Formulas Large
• A generalization of the Łoś-Tarski preservation theorem

zbMATH Keywords

finite model theoryundecidabilitylocalitypreservation theoremtree depthwell quasi orderingGaifman normal form

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Decidability of theories and sets of sentences (03B25)

Cites Work

• Subgraphs and well‐quasi‐ordering
• Elements of finite model theory.
• Sparsity. Graphs, structures, and algorithms
• Title not available (Why is that?)
• Properties preserved under homomorphism
• On nowhere dense graphs
• An existential locality theorem
• On the extending of models (I)
• Homomorphism preservation theorems
• The first order properties of products of algebraic systems
• Algorithmic uses of the Feferman-Vaught theorem
• Title not available (Why is that?)
• Well-quasi-order of relabel functions
• A counterexample to a conjecture of Scott and Suppes
• Preservation under Extensions on Well-Behaved Finite Structures
• On preservation under homomorphisms and unions of conjunctive queries
• Preservation and decomposition theorems for bounded degree structures

This page was built for publication: When locality meets preservation

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