Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation

Mathematical Logic Quarterly 27 (19‐21):289-332 (1981)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
13 (#288,494)

6 months
10 (#1,198,792)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Vaught's conjecture for monomorphic theories.Miloš S. Kurilić - 2019 - Annals of Pure and Applied Logic 170 (8):910-920.
Vaught’s conjecture for almost chainable theories.Miloš S. Kurilić - 2021 - Journal of Symbolic Logic 86 (3):991-1005.
Sharp Vaught's conjecture for some classes of partial orders.Miloš S. Kurilić - 2024 - Annals of Pure and Applied Logic 175 (4):103411.
Countable structures of given age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
Sandwiches of ages.Maurice Pouzet & Mohamed Sobrani - 2001 - Annals of Pure and Applied Logic 108 (1-3):295-326.

Add more citations

References found in this work

No references found.

Add more references