找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Domain Theory, Logic and Computation; Proceedings of the 2 G Q Zhang,J. Lawson,M.-K. Luo Conference proceedings 2003 Springer Science+Busin

[復(fù)制鏈接]
查看: 9055|回復(fù): 45
樓主
發(fā)表于 2025-3-21 16:53:38 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Domain Theory, Logic and Computation
副標(biāo)題Proceedings of the 2
編輯G Q Zhang,J. Lawson,M.-K. Luo
視頻videohttp://file.papertrans.cn/283/282514/282514.mp4
叢書名稱Semantics Structures in Computation
圖書封面Titlebook: Domain Theory, Logic and Computation; Proceedings of the 2 G Q Zhang,J. Lawson,M.-K. Luo Conference proceedings 2003 Springer Science+Busin
描述Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics. .Included in this proceedings volume are selected papers of original research presented at the 2nd International Symposium on Domain Theory in Chengdu, China. With authors from France, Germany, Great Britain, Ireland, Mexico, and China, the papers cover the latest research in these sub-areas: domains and computation, topology and convergence, domains, lattices, and continuity, and representations of domains as event and logical structures. .Researchers and students in theoretical computer science should find this a valuable source of reference. The survey papers at the beginning should be of particular interest to those who wish to gain an understanding of some general ideas and techniques in this area.
出版日期Conference proceedings 2003
關(guān)鍵詞Area; Congruence; Lattice; Mathematica; Natural; Volume; algorithms; data structures; logic; programming lang
版次1
doihttps://doi.org/10.1007/978-94-017-1291-0
isbn_softcover978-90-481-6523-0
isbn_ebook978-94-017-1291-0
copyrightSpringer Science+Business Media Dordrecht 2003
The information of publication is updating

書目名稱Domain Theory, Logic and Computation影響因子(影響力)




書目名稱Domain Theory, Logic and Computation影響因子(影響力)學(xué)科排名




書目名稱Domain Theory, Logic and Computation網(wǎng)絡(luò)公開度




書目名稱Domain Theory, Logic and Computation網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Domain Theory, Logic and Computation被引頻次




書目名稱Domain Theory, Logic and Computation被引頻次學(xué)科排名




書目名稱Domain Theory, Logic and Computation年度引用




書目名稱Domain Theory, Logic and Computation年度引用學(xué)科排名




書目名稱Domain Theory, Logic and Computation讀者反饋




書目名稱Domain Theory, Logic and Computation讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:40:02 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:49:08 | 只看該作者
地板
發(fā)表于 2025-3-22 05:47:59 | 只看該作者
5#
發(fā)表于 2025-3-22 11:04:32 | 只看該作者
External Characterizations of Continuous sL-domains,po . is a continuous sL-domain if and only if [. → .] is a continuous dcpo (resp: sL-domain) for all compact and core compact spaces .. This characterization solves Problem 532 posed by J. D. Lawson and M. W. Mislove in the book [J. Van Mill, G. M. Reed (Editors), Open Problems in Topology, Elsevier
6#
發(fā)表于 2025-3-22 16:10:51 | 只看該作者
7#
發(fā)表于 2025-3-22 18:05:35 | 只看該作者
On Minimal Event and Concrete Data Structures,n equivalence relations on the prime intervals of the domains we can associate different event structures and cds to a given domain, respectively. By introducing reductions we show the existence of a greatest event structure and cds as well as of minimal event structures and cds generating a given e
8#
發(fā)表于 2025-3-22 21:55:07 | 只看該作者
A Note on Strongly Finite Sequent Structures,tion by demanding the existence of a distinguished element with the properties of a tautology. This is no restriction compared with Zhang’s approach, but has several advantages. Moreover, we show that the entailment relation of every strongly finite sequent structure can be derived from a preorder.
9#
發(fā)表于 2025-3-23 04:14:32 | 只看該作者
Joakim Holmlund,Bj?rn Nilsson,Johan R?nnbynd a dcpo . is meet-continuous when . or it is a semilattice with a .-topology, where . denote the topology generated by all the Scott-open filters of .. Moreover, under appropriate conditions, the category of dcpos with .-topology form a cartesian closed category.
10#
發(fā)表于 2025-3-23 06:35:07 | 只看該作者
On Meet-Continuous Dcpos,nd a dcpo . is meet-continuous when . or it is a semilattice with a .-topology, where . denote the topology generated by all the Scott-open filters of .. Moreover, under appropriate conditions, the category of dcpos with .-topology form a cartesian closed category.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-24 17:43
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
金华市| 永福县| 古丈县| 九江县| 乐山市| 宝山区| 五台县| 贵港市| 彭州市| 临沂市| 河南省| 特克斯县| 商都县| 北川| 拉孜县| 松溪县| 嘉义市| 邵阳市| 海城市| 肥城市| 容城县| 嘉禾县| 柳州市| 辽阳市| 兴业县| 安化县| 滁州市| 西青区| 临安市| 万年县| 广汉市| 定结县| 凯里市| 焉耆| 靖州| 定日县| 苏尼特右旗| 鞍山市| 昌吉市| 台南县| 阿合奇县|