Order:
Disambiguations
Maurice Pouzet [6]Marc Pouzet [2]M. Pouzet [2]
  1.  17
    Application de la Notion de Relation Presque-Enchainable au Denombrement des Restrictions Finies D'une Relation.Maurice Pouzet - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (19-21):289-332.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  2.  2
    Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation.Maurice Pouzet - 1981 - Mathematical Logic Quarterly 27 (19‐21):289-332.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   4 citations  
  3. Systèmes Temps Réel 1: Techniques de Description Et de Vérification, Volume 1, Chapitre Lucid Synchrone, Un Langage de Programmation des Systèmes Réactifs. [REVIEW]Paul Caspi, Grégoire Hamon & Marc Pouzet - forthcoming - Hermes.
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. Systèmes Temps-réel: Techniques de Description et de Vérification–Théorie et Outils, volume 1, chapter Lucid Synchrone, un langage de programmation des systèmes réactifs.Paul Caspi, Grégoire Hamon & Marc Pouzet - forthcoming - Hermes.
    No categories
    Translate
     
     
    Export citation  
     
    Bookmark  
  5.  12
    The Length of an Intersection.Christian Delhommé & Maurice Pouzet - 2017 - Mathematical Logic Quarterly 63 (3-4):243-255.
    A poset math formula is well-partially ordered if all its linear extensions are well orders; the supremum of ordered types of these linear extensions is the length, math formula of p. We prove that if the vertex set X is infinite, of cardinality κ, and the ordering ⩽ is the intersection of finitely many well partial orderings math formula of X, math formula, then, letting math formula, with math formula, denote the euclidian division by κ of the length of each (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  9
    Equimorphy: The Case of Chains.C. Laflamme, M. Pouzet & R. Woodrow - 2017 - Archive for Mathematical Logic 56 (7-8):811-829.
    Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we provide structure results for chains having less than continuum many isomorphism classes of equimorphic chains. We deduce as a corollary that any chain has either a single isomorphism class of equimorphic chains or infinitely many.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  19
    Relation Minimale Pour Son??Ge.Maurice Pouzet - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (19-24):315-344.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  15
    Countable Structures of Given Age.H. D. Macpherson, M. Pouzet & R. E. Woodrow - 1992 - Journal of Symbolic Logic 57 (3):992-1010.
    Let L be a finite relational language. The age of a structure M over L is the set of isomorphism types of finite substructures of M. We classify those ages U for which there are less than 2ω countably infinite pairwise nonisomorphic L-structures of age U.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  2
    Sandwiches of Ages.Maurice Pouzet & Mohamed Sobrani - 2001 - Annals of Pure and Applied Logic 108 (1-3):295-326.
    The age of a relational structure R is the set A of finite restrictions of R considered up to isomorphism. R. Fraı̈ssé, who introduced this notion, showed that ages coincide with nonempty ideals of the poset consisting of finite relational structures, considered up to isomorphism and ordered by embeddability. Here, given two ages A ⊆ B , we study the poset D consisting of ages C in sandwich between A and B . Among other things we show that if D (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  10.  5
    Relation Minimale Pour Son Ǎge.Maurice Pouzet - 1979 - Mathematical Logic Quarterly 25 (19‐24):315-344.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation