Universality for orders and graphs which omit large substructures

DOI10.1305/NDJFL/1153858648zbMATH Open1113.03032OpenAlexW2091262730MaRDI QIDQ867404FDOQ867404

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

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

zbMATH Keywords

oriented graphsGCHordered structuresrelational theoriesuniversality spectra

Mathematics Subject Classification ID

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

Cited In (7)

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

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)