Type inference for set theory (Q5958782): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4023900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filter lambda model and the completeness of type assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topoi. The categorial analysis of logic. Rev. ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3405587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets, types and type-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301167 / rank
 
Normal rank

Latest revision as of 23:29, 3 June 2024

scientific article; zbMATH DE number 1715827
Language Label Description Also known as
English
Type inference for set theory
scientific article; zbMATH DE number 1715827

    Statements

    Type inference for set theory (English)
    0 references
    0 references
    3 March 2002
    0 references
    The author considers a weak fragment of ZF that may be used for set-theoretic specification. This fragment is essentially ZF without replacement and with separation restricted to \(\Delta _0\)-wff. He defines and studies a type inference system for this set theory.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    weak fragments of ZF set theory
    0 references
    set-theoretic specification
    0 references
    type inference
    0 references
    Zermelo set theory
    0 references
    MacLane set theory
    0 references