Relational structures constructible by quantifier free definable operations

DOI10.2178/JSL/1203350786MaRDI QIDQ5444700zbMATH OpenOpenAlexFDO

Authors S. Shelah, Mor Doron

Publication date 25 February 2008

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.jsl/1203350786

zbMATH Keywords

monatic second-order logic\(m\)-ary patch-width\(m\)-constructibilityspectra of monadic sentences

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Second- and higher-order model theory (03C85)

Recommendations

• Finite quantifier hierarchies in relational algebras
• Unary quantifiers on finite models
• Definability of polyadic lifts of generalized quantifiers
• On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width
• Quantifiers and congruence closure

Cites work

• Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
• Monadic second-order definable graph transductions: a survey
• On spectra of sentences of monadic second order logic with counting
• Recognizability, hypergraph operations, and logical types
• Structural properties of context-free sets of graphs generated by vertex replacement
• The monadic second-order logic of graphs. VII: Graphs as relational structures

This page was built for publication: Relational structures constructible by quantifier free definable operations

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