Switch to: References

Add citations

You must login to add citations.
  1. Classifying?0-categorical theories.George Weaver - 1988 - Studia Logica 47 (4):327-345.
    Among the complete ℵ0-categorical theories with finite non-logical vocabularies, we distinguish three classes. The classification is obtained by looking at the number of bound variables needed to isolated complete types. In classI theories, all types are isolated by quantifier free formulas; in classII theories, there is a leastm, greater than zero, s.t. all types are isolated by formulas in no more thanm bound variables: and in classIII theories, for eachm there is a type which cannot be isolated inm or fewer (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Extended order-generic queries.Oleg V. Belegradek, Alexei P. Stolboushkin & Michael A. Taitslin - 1999 - Annals of Pure and Applied Logic 97 (1-3):85-125.
    We consider relational databases organized over an ordered domain with some additional relations — a typical example is the ordered domain of rational numbers together with the operation of addition. In the focus of our study are the first-order queries that are invariant under order-preserving “permutations” — such queries are called order-generic. It has recently been discovered that for some domains order-generic FO queries fail to express more than pure order queries. For example, every order-generic FO query over rational numbers (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations