Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
From MaRDI portal
Publication:3964540
DOI10.1002/malq.19810271902zbMath0499.03019OpenAlexW2079167981MaRDI QIDQ3964540
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)
Related Items (14)
Enchainabilité et seuil de monomorphie des tournois \(n\)-aires. (Chainability and threshold of the monomorphy of \(n\)-ary tournaments) ⋮ Vaught's conjecture for monomorphic theories ⋮ Countable structures of given age ⋮ Sharp Vaught's conjecture for some classes of partial orders ⋮ Hereditary classes of ordered binary structures ⋮ When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron ⋮ Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ Sandwiches of ages ⋮ A survey of homogeneous structures ⋮ Inexhaustible homogeneous structures ⋮ Sperner properties for groups and relations ⋮ VAUGHT’S CONJECTURE FOR ALMOST CHAINABLE THEORIES ⋮ Vaught's conjecture for theories admitting finite monomorphic decompositions
This page was built for publication: Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
