Recursively Saturated Models of Set Theory (Q3902995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4075450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of the axioms of local and universal choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and local choice functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Kleene-Moschovakis Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5642550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary induction on abstract structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models with compactness properties relative to an admissible language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to the identification of admissible sets above structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward model theory through recursive saturation / rank
 
Normal rank

Latest revision as of 11:39, 13 June 2024

scientific article
Language Label Description Also known as
English
Recursively Saturated Models of Set Theory
scientific article

    Statements

    0 references
    1980
    0 references
    nonstandard models of set theory
    0 references
    well founded parts of models
    0 references
    comprehension
    0 references
    Recursively Saturated Models of Set Theory (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references