Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)最新文献_第5页

Type inference for recursive definitions 递归定义的类型推断

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782600

A. Kfoury, Santiago M. Pericás-Geertsen

引用次数: 6

A fully abstract game semantics for finite nondeterminism 有限不确定性的完全抽象博弈语义

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782637

Russell Harmer, G. McCusker

引用次数: 109

Guarded fixed point logic 保护不动点逻辑

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782585

E. Grädel, I. Walukiewicz

引用次数: 171

First-order logic vs. fixed-point logic in finite set theory 有限集合论中的一阶逻辑与不动点逻辑

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782622

Albert Atserias, Phokion G. Kolaitis

{"title":"First-order logic vs. fixed-point logic in finite set theory","authors":"Albert Atserias, Phokion G. Kolaitis","doi":"10.1109/LICS.1999.782622","DOIUrl":"https://doi.org/10.1109/LICS.1999.782622","url":null,"abstract":"The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has been established that either way of settling this conjecture would resolve open problems in complexity theory. In fact, this holds true even for the particular instance of the ordered conjecture on the class of BIT-structures, that is, ordered finite structures with a built-in BIT predicate. Using a well known isomorphism from the natural numbers to the hereditarily finite sets that maps BIT to the membership relation between sets, the ordered conjecture on BIT-structures can be translated to the problem of comparing the expressive power of FO and LFP in the context of finite set theory. The advantage of this approach is that we can use set-theoretic concepts and methods to identify certain fragments of LFP for which the restriction of the ordered conjecture is already hard to settle, as well as other restricted fragments of LFP that actually collapse to FO. These results advance the state of knowledge about the ordered conjecture on BIT-structures and contribute to the delineation of the boundary where this conjecture becomes hard to settle.","PeriodicalId":352531,"journal":{"name":"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123591052","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

A new approach to abstract syntax involving binders 一种涉及绑定的抽象语法的新方法

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-07-02 DOI: 10.1109/LICS.1999.782617

M. Gabbay, A. Pitts

引用次数: 346

Weak bisimulation and open maps 弱双模拟和开放地图

Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158) Pub Date : 1999-01-14 DOI: 10.1109/LICS.1999.782590

M. Fiore, Gian Luca Cattani, G. Winskel

引用次数: 66