Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)On the number of automorphisms of uncountable models.Saharon Shelah, Heikki Tuuri & Jouko Väänänen - 1993 - Journal of Symbolic Logic 58 (4):1402-1418.
    Let σ(U) denote the number of automorphisms of a model U of power ω1. We derive a necessary and sufficient condition in terms of trees for the existence of an U with $\omega_1 < \sigma(\mathfrak{U}) < 2^{\omega_1}$. We study the sufficiency of some conditions for σ(U) = 2ω1 . These conditions are analogous to conditions studied by D. Kueker in connection with countable models.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the homogeneity property for certain quantifier logics.Heike Mildenberger - 1992 - Archive for Mathematical Logic 31 (6):445-455.
    The local homogeneity property is defined as in [Mak]. We show thatL ωω(Q1) and some related logics do not have the local homogeneity property, whereas cofinality logicL ωω(Q cfω) has the homogeneity property. Both proofs use forcing and absoluteness arguments.
    Download  
     
    Export citation  
     
    Bookmark  
  • Onκ-complete reduced products.Tapani Hyttinen - 1992 - Archive for Mathematical Logic 31 (3):193-199.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • There are reasonably nice logics.Wilfrid Hodges & Saharon Shelah - 1991 - Journal of Symbolic Logic 56 (1):300-322.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Some characterization theorems for infinitary universal horn logic without equality.Pilar Dellunde & Ramon Jansana - 1996 - Journal of Symbolic Logic 61 (4):1242-1260.
    In this paper we mainly study preservation theorems for two fragments of the infinitary languagesLκκ, withκregular, without the equality symbol: the universal Horn fragment and the universal strict Horn fragment. In particular, whenκisω, we obtain the corresponding theorems for the first-order case.The universal Horn fragment of first-order logic (with equality) has been extensively studied; for references see [10], [7] and [8]. But the universal Horn fragment without equality, used frequently in logic programming, has received much less attention from the model (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations