Second-order quantifiers and the complexity of theories

From MaRDI portal
Publication:1078169

DOI10.1305/ndjfl/1093870870zbMath0596.03033OpenAlexW2084701730MaRDI QIDQ1078169

Saharon Shelah, John T. Baldwin

Publication date: 1985

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093870870




Related Items

Simple monadic theories and partition widthTrivial pursuit: remarks on the main gapMore on monadic logic. Part D: A note on addition of theoriesNotes on monadic logic. A: Monadic theory of the real lineTheories with few non-algebraic types over models, and their decompositionsToward classifying unstable theories0-categorical tree-decomposable structuresMonadic stability and growth rates of ω$\omega$‐categorical structuresWorst-case expansions of complete theoriesNotes on monadic logic. Part B: Complexity of linear orders in ZFCMore on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\)Some coinductive graphsRegular partitions of gentle graphsClasses of graphs with low complexity: the case of classes with bounded linear rankwidthPeano arithmetic may not be interpretable in the monadic theory of linear ordersTriviality, NDOP and stable varietiesCharacterizations of monadic NIPMutually algebraic structures and expansions by predicatesLocally modular theories of finite rankA model-theoretic characterisation of clique widthComplete Coinductive Theories. ISimple monadic theories and indiscerniblesStrict superstablity and decidability of certain generic graphsRanks and pregeometries in finite diagramsElementary equivalence of infinite-dimensional classical groupsFirst-order theories of abstract dependence relations