6 found
Order:
  1.  40
    Every Real Closed Field has an Integer Part.M. H. Mourgues & J. P. Ressayre - 1993 - Journal of Symbolic Logic 58 (2):641-647.
    Let us call an integer part of an ordered field any subring such that every element of the field lies at distance less than 1 from a unique element of the ring. We show that every real closed field has an integer part.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  2. [Omnibus Review].J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.
  3.  32
    Formal Languages Defined by the Underlying Structure of Their Words.J. P. Ressayre - 1988 - Journal of Symbolic Logic 53 (4):1009-1026.
    i) We show for each context-free language L that by considering each word of L as a structure in a natural way, one turns L into a finite union of classes which satisfy a finitary analog of the characteristic properties of complete universal first order classes of structures equipped with elementary embeddings. We show this to hold for a much larger class of languages which we call free local languages. ii) We define local languages, a class of languages between free (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  25
    Stretchings.O. Finkel & J. P. Ressayre - 1996 - Journal of Symbolic Logic 61 (2):563-585.
    A structure is locally finite if every finitely generated substructure is finite; local sentences are universal sentences all models of which are locally finite. The stretching theorem for local sentences expresses a remarkable reflection phenomenon between the finite and the infinite models of local sentences. This result in part requires strong axioms to be proved; it was studied by the second named author, in a paper of this Journal, volume 53. Here we correct and extend this paper; in particular we (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  14
    Π 2 1 -Logic and Uniformization in the Analytical Hierarchy.J. P. Ressayre - 1989 - Archive for Mathematical Logic 28 (2):99-117.
    We give a simple proof ofΠ 1 1 andΠ 2 1 uniformization results, which is based on the use ofΠ 2 1 -Logic.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  12
    Haim Gaifman. Models and Types of Peano's Arithmetic. Annals of Mathematical Logic, Vol. 9, Pp. 223–306. - Julia F. Knight. Omitting Types in Set Theory and Arithmetic. The Journal of Symbolic Logic, Vol. 41 , Pp. 25–32. - Julia F. Knight. Hanf Numbers for Omitting Types Over Particular Theories. The Journal of Symbolic Logic, Vol. 41 , Pp. 583–588. - Fred G. Abramson and Leo A. Harrington. Models Without Indiscernibles. The Journal of Symbolic Logic, Vol. 41 , Vol. 43 , Pp. 572–600. [REVIEW]J. P. Ressayre - 1983 - Journal of Symbolic Logic 48 (2):484-485.