No label defined (Q3699677)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3924762
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3924762 |
Statements
1985
0 references
complete partial orders
0 references
infinitary CPOs
0 references
semantic domains
0 references
canonical metric
0 references
topological properties
0 references
induced topology
0 references
Lawson topology
0 references
ordered domains
0 references
infinitary objects
0 references
order completions
0 references
metric completions
0 references
metric structure of functional spaces
0 references
computable completions
0 references
decidable objects
0 references
effective Cauchy sequences
0 references
syntactic CPOs
0 references
finitary elements
0 references
0.7985630035400391
0 references
0.7985630035400391
0 references
0.7780397534370422
0 references
0.7717316746711731
0 references
[For the entire collection see Zbl 0568.00021.] The paper presents infinitary CPOs (serving as a basic frame for describing semantic domains according to Scott) from a metric point of view. For infinitary CPOs (consisting of finitary and infinitary objects, the latter ones being described as lub's of ascending chains of their finite approximations) a canonical metric is constructed with a numbering of the finitary elements; the topological properties are proved not to be dependent on the choice of the numbering and the induced topology to be the Lawson topology. For the metric treatment of ordered domains it is proved that infinitary objects defined by order completions are the same as those defined by metric completions. This result is followed by a study of the metric structure of functional spaces and there are related pointwise, uniform and metric convergences. Eventually, computable completions are dealt with. An effective version of previous results of the paper is presented, the decidable objects of computable infinitary CPOs are shown to be the limits of effective Cauchy sequences and a special class of the so-called syntactic CPOs is introduced in which every infinitary effective element is decidable and is defined as a limit of a Cauchy sequence of finitary elements.
0 references