Pub Date : 2001-10-07DOI: 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}
Pub Date : 2001-10-07DOI: 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}
{"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}
{"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}
Pub Date : 2001-10-07DOI: 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}
{"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}
Pub Date : 2001-10-07DOI: 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}
{"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}
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}
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：