5 found
Order:
  1.  22
    Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
    Let be the set of nonnegative integers. We show the two following facts about Presburger's arithmetic:1. 1. Let . If L is not definable in , + then there is an definable in , such that there is no bound on the distance between two consecutive elements of L′. and2. 2. is definable in , + if and only if every subset of which is definable in is definable in , +. These two Theorems are of independent interest but we (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  2.  21
    Completely decomposable abelian groups -categorical over a subgroup.Roger Villemaire - 1992 - Archive for Mathematical Logic 31 (4):263-275.
  3.  9
    Homogeneity and fix-points: Going forth!Roger Villemaire - 2015 - Journal of Symbolic Logic 80 (2):636-660.
  4.  7
    Reasoning about visibility.Roger Villemaire & Sylvain Hallé - 2012 - Journal of Applied Logic 10 (2):163-178.
  5.  25
    Theories of modules closed under direct products.Roger Villemaire - 1992 - Journal of Symbolic Logic 57 (2):515-521.
    We generalize to theories of modules (complete or not) a result of U. Felgner stating that a complete theory of abelian groups is a Horn theory if and only if it is closed under products. To prove this we show that a reduced product of modules $\Pi_F M_i (i \in I)$ is elementarily equivalent to a direct product of ultraproducts of the modules $M_i (i \in I)$.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark