Switch to: References

Add citations

You must login to add citations.
  1. Cauchy completeness in elementary logic.J. C. Cifuentes, A. M. Sette & D. Mundici - 1996 - Journal of Symbolic Logic 61 (4):1153-1157.
    The inverse of the distance between two structures $\mathscr{A} \not\equiv \mathscr{B}$ of finite type τ is naturally measured by the smallest integer q such that a sentence of quantifier rank q - 1 is satisfied by A but not by B. In this way the space $\operatorname{Str}^\tau$ of structures of type τ is equipped with a pseudometric. The induced topology coincides with the elementary topology of $\operatorname{Str}^\tau$ . Using the rudiments of the theory of uniform spaces, in this elementary note (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Omitting uncountable types and the strength of [0,1]-valued logics.Xavier Caicedo & José N. Iovino - 2014 - Annals of Pure and Applied Logic 165 (6):1169-1200.
    We study a class of [0,1][0,1]-valued logics. The main result of the paper is a maximality theorem that characterizes these logics in terms of a model-theoretic property, namely, an extension of the omitting types theorem to uncountable languages.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • XI Latin American Symposium on Mathematical Logic.Carlos Augusto Di Prisco - 1999 - Bulletin of Symbolic Logic 5 (4):495-524.
    Download  
     
    Export citation  
     
    Bookmark