Zobrazeno 1 - 10
of 127
pro vyhledávání: '"Scott domain"'
Autor:
Harold Bennet, David Lutzer
Publikováno v:
Applied General Topology, Vol 9, Iss 2, Pp 281-292 (2008)
In this paper we show that a variation of a technique of Miskin and Tall yields a cocompact completely regular Moore space that is Scott-domain-representable and has a closed Gδ-subspace that is not Scott-domain-representable. This clarifies the gen
Externí odkaz:
https://doaj.org/article/80c28e09572b4086b504e12c4f37e5c0
Autor:
Longchun Wang, Qingguo Li
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030592660
TAMC
TAMC
Based on the investigation of the proof system of a disjunctive propositional logic, this paper establishes a purely, syntactic representation of Scott-domains. More precisely, a category of certain proof systems with consequence relations is shown t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::579ac78dfc9b07e7bac74f6278cd8df0
https://doi.org/10.1007/978-3-030-59267-7_28
https://doi.org/10.1007/978-3-030-59267-7_28
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jacques Duparc, Louis Vuilleumier
We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets $\mathbb{P}_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abb02b38451fa63b58aaa93e2a2d5725
http://arxiv.org/abs/1902.09419
http://arxiv.org/abs/1902.09419
Autor:
A.C. Megaritis, D.N. Georgiou
Publikováno v:
Filomat. 29:193-207
Let L be a complete lattice. On L we define the so called quasi Scott topology, denoted by qSc. This topology is always larger than or equal to the Scott topology and smaller than or equal to the strong Scott topology. Results concerning the above to
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Andrew M. Pitts, Steffen Lösch
Publikováno v:
Journal of the ACM. 61:1-46
When defining computations over syntax as data, one often runs into tedious issues concerning α -equivalence and semantically correct manipulations of binding constructs. Here we study a semantic framework in which these issues can be dealt with aut
Autor:
Lei Fan, Li-Gang Wu
Publikováno v:
ISDT
[Fan L., W. Ji and W. L. Wang. “The Information Order Approximation and Generalized Chains' Completion”, Beijing: Capital Normal University, Preprint, 2005. (in Chinese), Lei Fan] proposed a class of sets with families of pre-orders (R-posets for
Autor:
Dieter Spreen
Publikováno v:
Theoretical Computer Science
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for each atomic p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e92d4f5038a5e0162b066015276aa6e8
Autor:
Johnny Feng
Publikováno v:
Foundations of Physics. 42:959-975
In this paper we prove the space of unital qubit channels is a Scott domain. In the process we provide a simple protocol to achieve Holevo capacity for these channels.