|
gptkbp:instanceOf
|
gptkb:logic
|
|
gptkbp:assumes
|
sets can be freely formed
|
|
gptkbp:author
|
gptkb:Paul_Halmos
|
|
gptkbp:basisFor
|
early set theory
|
|
gptkbp:characterizedBy
|
informal reasoning about sets
|
|
gptkbp:contrastsWith
|
gptkb:set_theory
|
|
gptkbp:describedBy
|
gptkb:Naive_Set_Theory_(book)
|
|
gptkbp:developedBy
|
late 19th century
|
|
gptkbp:field
|
gptkb:set_theory
|
|
gptkbp:hasConcept
|
gptkb:cardinality
gptkb:Venn_diagram
gptkb:De_Morgan's_laws
gptkb:intersection
gptkb:Union
infinite sets
power set
bijection
cardinal numbers
injection
ordinal numbers
partitions
real numbers
inclusion
natural numbers
difference
functions
relations
finite sets
Cartesian product
complement
empty set
subset
universal set
well-ordering
surjection
equivalence relations
countable sets
uncountable sets
infinite cardinalities
ordered pairs
set membership
symmetric difference
|
|
gptkbp:hasNo
|
formal axioms
|
|
gptkbp:notableParadox
|
gptkb:Russell's_paradox
gptkb:Burali-Forti_paradox
|
|
gptkbp:replacedBy
|
gptkb:set_theory
gptkb:Zermelo-Fraenkel_set_theory
|
|
gptkbp:subject
|
paradoxes
|
|
gptkbp:usedBy
|
gptkb:Georg_Cantor
|
|
gptkbp:bfsParent
|
gptkb:Set_Theory
|
|
gptkbp:bfsLayer
|
5
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
naive set theory
|