发布求助
文献互助 智能选刊 最新文献

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science最新文献

筛选
英文 中文
A category of labelled Petri nets and compositional proof system 一类标记Petri网及其组成证明系统
[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science Pub Date : 1988-07-05 DOI: 10.1109/LICS.1988.5113
G. Winskel
{"title":"A category of labelled Petri nets and compositional proof system","authors":"G. Winskel","doi":"10.1109/LICS.1988.5113","DOIUrl":"https://doi.org/10.1109/LICS.1988.5113","url":null,"abstract":"An attempt is made to cast labeled Petri nets and other models in an algebraic framework. One aim is to utilize the framework of categorical l to cast labeled Petri nets and other models in an algebraic framework. The other aim is to utilize the framework of categorical logic to systematize specification languages and the derivation of proof systems for parallel processes. A category of labeled nets is presented, and its categorical constructions are used to establish a compositional proof system. A category of properties of nets is used in forming the proof system.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116731786","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}
引用次数: 41
Proving unprovability 证明不可证明性
[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science Pub Date : 1900-01-01 DOI: 10.1109/LICS.1988.5097
Michael L. Tiomkin
{"title":"Proving unprovability","authors":"Michael L. Tiomkin","doi":"10.1109/LICS.1988.5097","DOIUrl":"https://doi.org/10.1109/LICS.1988.5097","url":null,"abstract":"A formal proof system for unprovability in the predicate calculi is developed. This system is shown to be complete with respect to the logic of finite structures. It can be used to extend the 'negation by failure' of Prolog, prevent infinite loops in a deductive data base or Prolog, or prove formulaes in nonmonotonic (default) logic.<<ETX>>","PeriodicalId":425186,"journal":{"name":"[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127049569","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}
引用次数: 20
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信