This HTML5 document contains 66 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/
n6http://dbpedia.org/resource/Wiktionary:
n15http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n16http://dbpedia.org/resource/%3F:
n11https://global.dbpedia.org/id/
dbpedia-ukhttp://uk.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n7http://commons.wikimedia.org/wiki/Special:FilePath/
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#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Post's_lattice
rdfs:label
Post's lattice Решітка Поста
rdfs:comment
In logic and universal algebra, Post's lattice denotes the lattice of all clones on a two-element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941. The relative simplicity of Post's lattice is in stark contrast to the lattice of clones on a three-element (or larger) set, which has the cardinality of the continuum, and a complicated inner structure. A modern exposition of Post's result can be found in Lau (2006). Решітка Поста (ґратка Поста) — ґратка всіх клонів на булевій множині (булева множина позначається 2={0, 1}) відсортована за включенням. Була описана Емілем Постом в 1941 році. Використовується в математичній логіці та універсальній алгебрі.
foaf:depiction
n7:Post-lattice-centre.svg n7:Post-lattice.svg n7:Post_lattice_with_constants.svg
dcterms:subject
dbc:Logic dbc:Universal_algebra
dbo:wikiPageID
15536340
dbo:wikiPageRevisionID
1088369862
dbo:wikiPageWikiLink
dbr:Negation dbr:Satisfiability_problem dbr:Clone_(algebra) dbr:Universal_algebra dbr:De_Morgan_dual dbr:Propositional_variable n6:juxtaposition dbr:NP-complete dbr:Cardinality_of_the_continuum dbr:Logical_conjunction dbr:Lattice_(order) dbr:Cartesian_product dbr:Intersection_(set_theory) dbr:Formula_(mathematical_logic) n15:Post_lattice_with_constants.svg dbr:Material_nonimplication dbr:Closure_system dbr:Inclusion_(set_theory) dbr:Boolean_algebra_(structure) n16: dbr:Logic dbr:Boolean_function dbr:Meet_(mathematics) dbc:Logic dbr:Cook's_theorem dbr:Functional_completeness dbr:Exclusive_disjunction dbr:Operation_(mathematics) dbc:Universal_algebra dbr:Boolean_ring dbr:Material_conditional dbr:Majority_function dbr:Join_(mathematics) dbr:Projection_(set_theory) dbr:Logical_connective dbr:Addition dbr:Emil_Leon_Post dbr:Logical_biconditional dbr:Function_composition dbr:P_(complexity) dbr:Countably_infinite n15:Post-lattice-centre.svg dbr:Disjunction n15:Post-lattice.svg dbr:Complete_lattice
owl:sameAs
freebase:m.03mdj8d n11:Mcob dbpedia-uk:Решітка_Поста wikidata:Q13424705
dbo:thumbnail
n7:Post-lattice.svg?width=300
dbo:abstract
In logic and universal algebra, Post's lattice denotes the lattice of all clones on a two-element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941. The relative simplicity of Post's lattice is in stark contrast to the lattice of clones on a three-element (or larger) set, which has the cardinality of the continuum, and a complicated inner structure. A modern exposition of Post's result can be found in Lau (2006). Решітка Поста (ґратка Поста) — ґратка всіх клонів на булевій множині (булева множина позначається 2={0, 1}) відсортована за включенням. Була описана Емілем Постом в 1941 році. Використовується в математичній логіці та універсальній алгебрі.
prov:wasDerivedFrom
wikipedia-en:Post's_lattice?oldid=1088369862&ns=0
dbo:wikiPageLength
15174
foaf:isPrimaryTopicOf
wikipedia-en:Post's_lattice