Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,395,273 papers from all fields of science
Search
Sign In
Create Free Account
Scott domain
In the mathematical fields of order and domain theory, a Scott domain is an algebraic, bounded complete cpo. It has been named in honour of Dana S…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Broader (1)
Domain theory
Information algebra
Prefix order
Scott continuity
Scott information system
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Natural non-dcpo domains and f-spaces
V. Sazonov
Annals of Pure and Applied Logic
2009
Corpus ID: 12469352
2007
2007
Scott Domain Representability of a Class of Generalized Ordered Spaces
Kevin W. Duke
,
D. Lutzer
2007
Corpus ID: 12068044
Many important topological examples (the Sorgenfrey line, the Michael line) belong to the class of GO-spaces constructed on the…
Expand
2006
2006
Real-Time Stable Event Structures and Marked Scott Domains: An Adjunction
R. Dubtsov
Ershov Memorial Conference
2006
Corpus ID: 33954302
Event structures constitute a major branch of models for concurrency. Their advantage is that they explicitly exhibit the…
Expand
Review
2001
Review
2001
Notions of computability at higher types II
J. Longley
2001
Corpus ID: 15592859
In Part I of this series of papers [Lon01a] we gave a historical survey of the study of notions of higher-type computability. In…
Expand
2001
2001
Towards scott domains-based topological ontology models
J. Fernández-breis
,
D. C. Nieves
,
R. Valencia-García
,
Pedro José Vivancos Vicente
,
R. Martínez-Béjar
,
M. L. Heras-González
Formal Ontology in Information Systems
2001
Corpus ID: 1277369
An ontology can be seen as an approximation to what exists in thereal world. An ontological model is the kernel used for…
Expand
1993
1993
On the congruence lattice of a Scott-domain
G. Grätzer
,
E. Schmidt
1993
Corpus ID: 122375416
We prove that the congruence lattice of a Scott-domain can be characterized as a complete lattice.
1993
1993
A remark about algebraicity in complete partial orders
L. Libkin
1993
Corpus ID: 121181639
1993
1993
Subrecursive hierarchies on Scott domains
Karl-Heinz Niggl
Archive for Mathematical Logic
1993
Corpus ID: 29627820
SummaryWe study a notion ofpartial primitive recursion (p.p.r.) including the concept ofparallelism in the context of partial…
Expand
1992
1992
Stable and Sequential Functions on Scott Domains
S. Brookes
,
S. Geva
1992
Corpus ID: 117177541
The search for a general semantic characterization of sequential functions is motivated by the full abstraction problem for…
Expand
1991
1991
The Dependent Product Construction in Various Categories of Domains
A. Jung
Theoretical Computer Science
1991
Corpus ID: 32709251
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE