Switch to: References

Add citations

You must login to add citations.
  1. The complexity of countable categoricity in finite languages.Aleksander Ivanov - 2012 - Mathematical Logic Quarterly 58 (1-2):105-112.
    We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
    Download  
     
    Export citation  
     
    Bookmark  
  • Model completions and omitting types.Terrence Millar - 1995 - Journal of Symbolic Logic 60 (2):654-672.
    Universal theories with model completions are characterized. A new omitting types theorem is proved. These two results are used to prove the existence of a universal ℵ 0 -categorical partial order with an interesting embedding property. Other aspects of these results also are considered.
    Download  
     
    Export citation  
     
    Bookmark   1 citation