Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
DOI10.1002/MALQ.19810271902zbMATH Open0499.03019OpenAlexW2079167981MaRDI QIDQ3964540FDOQ3964540
Authors: Maurice Pouzet 
Publication date: 1981
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19810271902
Enumerative combinatorics (05A99) Relational systems, laws of composition (08A02) Other classical set theory (including functions, relations, and set algebra) (03E20) Other classical first-order model theory (03C68)
Cited In (17)
- A survey of homogeneous structures
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- Sperner properties for groups and relations
- Hereditary classes of ordered binary structures
- Countable structures of given age
- Inexhaustible homogeneous structures
- The morphology of infinite tournaments; application to the growth of their profile
- Vaught's conjecture for almost chainable theories
- Vaught's conjecture for theories admitting finite monomorphic decompositions
- When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
- Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments)
- Algebras, Graphs and Ordered Sets – ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet
- Well-quasi-ordering and Embeddability of Relational Structures
- A short note on the characterization of countable chains with finite big Ramsey spectra
- Sandwiches of ages
- Vaught's conjecture for monomorphic theories
- Sharp Vaught's conjecture for some classes of partial orders
This page was built for publication: Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3964540)
