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

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

Namespace Prefixes

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

Statements

Subject Item
dbr:Suslin_algebra
rdfs:label
Suslin algebra
rdfs:comment
In mathematics, a Suslin algebra is a Boolean algebra that is complete, atomless, countably distributive, and satisfies the countable chain condition. They are named after Mikhail Yakovlevich Suslin. The existence of Suslin algebras is independent of the axioms of ZFC, and is equivalent to the existence of Suslin trees or Suslin lines.
dcterms:subject
dbc:Independence_results dbc:Boolean_algebra dbc:Forcing_(mathematics)
dbo:wikiPageID
43236771
dbo:wikiPageRevisionID
1096580747
dbo:wikiPageWikiLink
dbr:Mikhail_Yakovlevich_Suslin dbr:ZFC dbc:Independence_results dbr:Suslin_line dbr:Complete_Boolean_algebra dbc:Boolean_algebra dbr:Countable_chain_condition dbc:Forcing_(mathematics) dbr:Boolean_algebra_(structure) dbr:Distributive_property dbr:Atom_(order_theory) dbr:Andrei_Suslin dbr:Suslin_tree
owl:sameAs
freebase:m.0114lhhg n13:mxqW wikidata:Q18386666
dbp:wikiPageUsesTemplate
dbt:Algebra-stub
dbo:abstract
In mathematics, a Suslin algebra is a Boolean algebra that is complete, atomless, countably distributive, and satisfies the countable chain condition. They are named after Mikhail Yakovlevich Suslin. The existence of Suslin algebras is independent of the axioms of ZFC, and is equivalent to the existence of Suslin trees or Suslin lines.
gold:hypernym
dbr:Algebra
prov:wasDerivedFrom
wikipedia-en:Suslin_algebra?oldid=1096580747&ns=0
dbo:wikiPageLength
1088
foaf:isPrimaryTopicOf
wikipedia-en:Suslin_algebra