This HTML5 document contains 24 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n7https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Double_extension_set_theory
rdfs:label
Double extension set theory
rdfs:comment
In mathematics, the Double extension set theory (DEST) is an axiomatic set theory proposed by Andrzej Kisielewicz consisting of two separate membership relations on the universe of sets, denoted here by and , and a set of axioms relating the two. The intention behind defining the two membership relations is to avoid the usual paradoxes of set theory, without substantially weakening the axiom of unrestricted comprehension.
dct:subject
dbc:Systems_of_set_theory
dbo:wikiPageID
68403860
dbo:wikiPageRevisionID
1041093450
dbo:wikiPageWikiLink
dbr:Axiomatic_set_theory dbr:Axiom_of_comprehension dbr:Russell's_paradox dbr:Mathematics dbr:Paradoxes_of_set_theory dbc:Systems_of_set_theory dbr:Set_theory
owl:sameAs
n7:Fyzei wikidata:Q108146676
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Settheory-stub dbt:Reflist dbt:Technical
dbo:abstract
In mathematics, the Double extension set theory (DEST) is an axiomatic set theory proposed by Andrzej Kisielewicz consisting of two separate membership relations on the universe of sets, denoted here by and , and a set of axioms relating the two. The intention behind defining the two membership relations is to avoid the usual paradoxes of set theory, without substantially weakening the axiom of unrestricted comprehension. Intuitively, in DEST, comprehension is used to define the elements of a set under one membership relation using formulas that involve only the other membership relation. Let be a first-order formula with free variable in the language of DEST not involving the membership relation . Then, the axioms of DEST posit a set such that . For instance, is a formula involving only , and thus DEST posits the Russell set , where . Observe that for , we obtain . Since the membership relations are different, we thus avoid the Russell's paradox. The focus in DEST is on regular sets, which are sets whose extensions under the two membership relations coincide, i.e., sets for which it holds that . The preceding discussion suggests that the Russell set cannot be regular, as otherwise it leads to the Russell's paradox.
prov:wasDerivedFrom
wikipedia-en:Double_extension_set_theory?oldid=1041093450&ns=0
dbo:wikiPageLength
2245
foaf:isPrimaryTopicOf
wikipedia-en:Double_extension_set_theory
Subject Item
dbr:Russell's_paradox
dbo:wikiPageWikiLink
dbr:Double_extension_set_theory
Subject Item
wikipedia-en:Double_extension_set_theory
foaf:primaryTopic
dbr:Double_extension_set_theory