Universality for orders and graphs which omit large substructures

DOI10.1305/NDJFL/1153858648MaRDI QIDQ867404zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 15 February 2007

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

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

zbMATH Keywords

GCHordered structuresoriented graphsrelational theoriesuniversality spectra

Mathematics Subject Classification ID

Set-theoretic model theory (03C55) Ordered sets and their cofinalities; pcf theory (03E04) Other combinatorial set theory (03E05) Continuum hypothesis and Martin's axiom (03E50)

Recommendations

• scientific article; zbMATH DE number 524139
• The universality spectrum of stable unsuperstable theories
• Universality results for well-founded posets
• Small universal families for graphs omitting cliques without GCH
• The spectrum problem. III: Universal theories

Cited in

(7)

• The spectrum problem. III: Universal theories
• Spectral universality of linear orders with one binary relation
• Universality results for well-founded posets
• scientific article; zbMATH DE number 524139 (Why is no real title available?)
• scientific article; zbMATH DE number 1072415 (Why is no real title available?)
• Small universal families for graphs omitting cliques without GCH
• Club guessing and the universal models

This page was built for publication: Universality for orders and graphs which omit large substructures

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