2007
DOI: 10.1002/malq.200610039
|View full text |Cite
|
Sign up to set email alerts
|

Uniform domain representations of ℓp‐spaces

Abstract: The category of Scott-domains gives a computability theory for possibly uncountable topological spaces, via representations. In particular, every separable Banach-space is representable over a separable domain. A large class of topological spaces, including all Banach-spaces, is representable by domains, and in domain theory, there is a well-understood notion of parametrizations over a domain. We explore the link with parameter-dependent collections of spaces in e. g. functional analysis through a case study o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…Other lifting results where density of D is not required can be found in Normann (2001), Blanck (2001) and Køber (2007).…”
Section: Proposition 210 Let (D Dmentioning
confidence: 99%
See 1 more Smart Citation
“…Other lifting results where density of D is not required can be found in Normann (2001), Blanck (2001) and Køber (2007).…”
Section: Proposition 210 Let (D Dmentioning
confidence: 99%
“…A more systematic study of representations from ordered structures, as well as the notion of domain representation, originate with Stoltenberg-Hansen and Tucker (1985;1988;1991;1993;1995;2007). Continuous domain representations are used in Edalat (1995a;1995b;, Edalat and Heckmann (1998) and Edalat and Lieutier (1999; to cover application areas from integration and differential equations to solid geometry.…”
Section: Related Workmentioning
confidence: 99%
“…One way to deal with this problem is to use partial continuous functions [20]. There are important situations where liftings can be achieved also for non-dense representations [14,45,56]. Like the definition of domain representability this notion of reducibility works with many types of ordered structures.…”
Section: Classes Of Domain Representationsmentioning
confidence: 99%