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

Proof Theory in Computer Science最新文献

筛选
英文 中文
Constructive Foundations for Featherweight Java 轻量级Java的建设性基础
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_13
T. Studer
{"title":"Constructive Foundations for Featherweight Java","authors":"T. Studer","doi":"10.1007/3-540-45504-3_13","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_13","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115359030","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}
引用次数: 13
Implicit Characterizations of Pspace p空间的隐式刻画
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_11
Isabel Oitavem
{"title":"Implicit Characterizations of Pspace","authors":"Isabel Oitavem","doi":"10.1007/3-540-45504-3_11","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_11","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121599284","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}
引用次数: 14
Reflective lambda-Calculus 反光的演算
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_2
Jesse Alt, Sergei N. Artëmov
{"title":"Reflective lambda-Calculus","authors":"Jesse Alt, Sergei N. Artëmov","doi":"10.1007/3-540-45504-3_2","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_2","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221006","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}
引用次数: 12
Proof Theory and Post-turing Analysis 证明理论与后图灵分析
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_9
L. Gordeev
{"title":"Proof Theory and Post-turing Analysis","authors":"L. Gordeev","doi":"10.1007/3-540-45504-3_9","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_9","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129170340","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}
引用次数: 0
Iterate Logic 迭代逻辑
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_12
P. Schmitt
{"title":"Iterate Logic","authors":"P. Schmitt","doi":"10.1007/3-540-45504-3_12","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_12","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133856799","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}
引用次数: 4
Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0 从genzen的极限归纳法证明中提取程序
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_5
Ulrich Berger
{"title":"Program Extraction from Gentzen's Proof of Transfinite Induction up to epsilon0","authors":"Ulrich Berger","doi":"10.1007/3-540-45504-3_5","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_5","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133570394","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}
引用次数: 0
Interpolation for Natural Deduction with Generalized Eliminations 自然演绎的广义消去插值
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_10
R. Matthes
{"title":"Interpolation for Natural Deduction with Generalized Eliminations","authors":"R. Matthes","doi":"10.1007/3-540-45504-3_10","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_10","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131248378","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}
引用次数: 9
Comparing the Complexity of Cut-Elimination Methods 比较各种消切方法的复杂性
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_4
M. Baaz, A. Leitsch
{"title":"Comparing the Complexity of Cut-Elimination Methods","authors":"M. Baaz, A. Leitsch","doi":"10.1007/3-540-45504-3_4","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_4","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127069639","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}
引用次数: 5
Linear Ramified Higher Type Recursion and Parallel Complexity 线性分支高类型递归与并行复杂性
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_1
Klaus Aehlig, Jan Johannsen, H. Schwichtenberg, S. Terwijn
{"title":"Linear Ramified Higher Type Recursion and Parallel Complexity","authors":"Klaus Aehlig, Jan Johannsen, H. Schwichtenberg, S. Terwijn","doi":"10.1007/3-540-45504-3_1","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_1","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116310422","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}
引用次数: 7
A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity 关于恒等图式单一应用的证明理论强度的注记
Proof Theory in Computer Science Pub Date : 2001-10-07 DOI: 10.1007/3-540-45504-3_3
M. Baaz, C. Fermüller
{"title":"A Note on the Proof-Theoretic Strength of a Single Application of the Schema of Identity","authors":"M. Baaz, C. Fermüller","doi":"10.1007/3-540-45504-3_3","DOIUrl":"https://doi.org/10.1007/3-540-45504-3_3","url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130642059","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}
引用次数: 4
下一页 尾页
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学术官方微信