Simple monadic theories and partition width
DOI10.1002/MALQ.201010019zbMATH Open1247.03063OpenAlexW2010958543MaRDI QIDQ3170562FDOQ3170562
Authors: Achim Blumensath 
Publication date: 27 September 2011
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201010019
Recommendations
monadic second-order logicindiscernible sequencespartition widthdefinable pairing functionstree-like decompositions of models
Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50) Second- and higher-order model theory (03C85)
Cites Work
- Classification theory and the number of non-isomorphic models.
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Approximating clique-width and branch-width
- Model Theory
- Transforming structures by set interpretations
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Monadic second-order logic on tree-like structures
- Vertex-minors, monadic second-order logic, and a conjecture by Seese
- S-functions for graphs
- Graph minors. III. Planar tree-width
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- An Extension of Muchnik's Theorem
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs
- The structure of the models of decidable monadic theories of graphs
- Modest theory of short chains. I
- Algorithmic uses of the Feferman-Vaught theorem
- On the structure of graphs in the Caucal hierarchy
- The monadic theory of order
- Clique-width of countable graphs: A compactness property.
- A model-theoretic characterisation of clique width
- Around classification theory of models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Second-order quantifiers and the complexity of theories
- Fusion in relational structures and the verification of monadic second-order properties
- Title not available (Why is that?)
- Recognizability, hypergraph operations, and logical types
- Monadic logic and Löwenheim numbers
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- Structural properties of context-free sets of graphs generated by vertex replacement
- The monadic second-order logic of graphs. IX: Machines and their behaviours
- Title not available (Why is that?)
- Axiomatising tree-interpretable structures
- Modest theory of short chains. II
- The recognizability of sets of graphs is a robust property
- The Monadic Theory of Tree-like Structures
- Simple monadic theories and indiscernibles
Cited In (2)
This page was built for publication: Simple monadic theories and partition width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170562)
