Universality for orders and graphs which omit large substructures

DOI10.1305/ndjfl/1153858648zbMath1113.03032OpenAlexW2091262730MaRDI QIDQ867404

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

oriented graphsGCHordered structuresrelational theoriesuniversality spectra

Mathematics Subject Classification ID

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

Related Items (2)

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