This HTML5 document contains 30 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/
n5https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n9http://www.entcs.org/files/mfps19/
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:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Lawson_topology
rdfs:label
Lawson topology
rdfs:comment
In mathematics and theoretical computer science the Lawson topology, named after Jimmie D. Lawson, is a topology on partially ordered sets used in the study of domain theory. The lower topology on a poset P is generated by the subbasis consisting of all complements of principal filters on P. The Lawson topology on P is the smallest common refinement of the lower topology and the Scott topology on P.
dcterms:subject
dbc:Domain_theory dbc:General_topology
dbo:wikiPageID
23600625
dbo:wikiPageRevisionID
1061554133
dbo:wikiPageWikiLink
dbr:Partially_ordered_set dbr:Domain_theory dbr:Poset dbr:Scott_topology dbr:Filter_(mathematics) dbc:Domain_theory dbr:Formal_ball dbc:General_topology dbr:Semilattice dbr:Completely_uniformizable_space dbr:T1_topology dbr:Topology dbr:Dana_Scott
dbo:wikiPageExternalLink
n9:83011.pdf
owl:sameAs
n5:4qDMA wikidata:Q6505020 freebase:m.06zqf3l
dbp:wikiPageUsesTemplate
dbt:Topology-stub dbt:Isbn
dbo:abstract
In mathematics and theoretical computer science the Lawson topology, named after Jimmie D. Lawson, is a topology on partially ordered sets used in the study of domain theory. The lower topology on a poset P is generated by the subbasis consisting of all complements of principal filters on P. The Lawson topology on P is the smallest common refinement of the lower topology and the Scott topology on P.
gold:hypernym
dbr:Topology
prov:wasDerivedFrom
wikipedia-en:Lawson_topology?oldid=1061554133&ns=0
dbo:wikiPageLength
1260
foaf:isPrimaryTopicOf
wikipedia-en:Lawson_topology