Simple monadic theories and partition width

DOI10.1002/MALQ.201010019MaRDI QIDQ3170562zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

monadic second-order logicindiscernible sequencespartition widthdefinable pairing functionstree-like decompositions of models

Mathematics Subject Classification ID

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)

Recommendations

• Simple monadic theories and indiscernibles
• A model-theoretic characterisation of clique width
• The structure of the models of decidable monadic theories of graphs
• Partitioning graphs of bounded tree-width
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width

Cites work

• scientific article; zbMATH DE number 3880651 (Why is no real title available?)
• scientific article; zbMATH DE number 2102748 (Why is no real title available?)
• scientific article; zbMATH DE number 2113455 (Why is no real title available?)
• scientific article; zbMATH DE number 914513 (Why is no real title available?)
• A model-theoretic characterisation of clique width
• Algorithmic uses of the Feferman-Vaught theorem
• An Extension of Muchnik's Theorem
• Approximating clique-width and branch-width
• Around classification theory of models
• Axiomatising tree-interpretable structures
• Classification theory and the number of non-isomorphic models.
• Clique-width of countable graphs: A compactness property.
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Fusion in relational structures and the verification of monadic second-order properties
• Graph minors. III. Planar tree-width
• Handle-rewriting hypergraph grammars
• Model Theory
• Modest theory of short chains. I
• Modest theory of short chains. II
• Monadic logic and Löwenheim numbers
• Monadic second-order logic on tree-like structures
• On the structure of graphs in the Caucal hierarchy
• Recognizability, hypergraph operations, and logical types
• S-functions for graphs
• Second-order quantifiers and the complexity of theories
• Simple monadic theories and indiscernibles
• Structural properties of context-free sets of graphs generated by vertex replacement
• The Monadic Theory of Tree-like Structures
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs
• The monadic second-order logic of graphs. IX: Machines and their behaviours
• The monadic second-order logic of graphs. VII: Graphs as relational structures
• The monadic theory of order
• The recognizability of sets of graphs is a robust property
• The structure of the models of decidable monadic theories of graphs
• Transforming structures by set interpretations
• Upper bounds to the clique width of graphs
• Vertex-minors, monadic second-order logic, and a conjecture by Seese

Cited in

(2)

• Characterizations of monadic NIP
• Simple monadic theories and indiscernibles

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)