Switch to: References

Add citations

You must login to add citations.
  1. Model theory of the inaccessibility scheme.Shahram Mohsenipour - 2011 - Archive for Mathematical Logic 50 (7-8):697-706.
    Suppose L = { <,...} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a κ-like model where κ is an inaccessible cardinal. Such T proves the Inaccessibility Scheme. In this paper we study elementary end extensions of models of the inaccessibility scheme.
    Download  
     
    Export citation  
     
    Bookmark