从genzen的极限归纳法证明中提取程序

{"title":"从genzen的极限归纳法证明中提取程序","authors":"Ulrich Berger","doi":"10.1007/3-540-45504-3_5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":226486,"journal":{"name":"Proof Theory in Computer Science","volume":"477 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":226486,\"journal\":{\"name\":\"Proof Theory in Computer Science\",\"volume\":\"477 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proof Theory in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/3-540-45504-3_5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proof Theory in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-45504-3_5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}