{"title":"蠕虫原理","authors":"L. Beklemishev","doi":"10.1017/9781316755723.005","DOIUrl":null,"url":null,"abstract":"In [6] an approach to proof-theoretic analysis of Peano arithmetic \nbased an the motion of graded provability algebra was suggested. Here we present a provability-algebraic version of the independent combinatorial Hydra battle principle. This allows for simple independence proofs of both principles based on provability-algebraic methods.","PeriodicalId":161799,"journal":{"name":"Logic group preprint series","volume":"219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":"{\"title\":\"The Worm principle\",\"authors\":\"L. Beklemishev\",\"doi\":\"10.1017/9781316755723.005\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In [6] an approach to proof-theoretic analysis of Peano arithmetic \\nbased an the motion of graded provability algebra was suggested. Here we present a provability-algebraic version of the independent combinatorial Hydra battle principle. This allows for simple independence proofs of both principles based on provability-algebraic methods.\",\"PeriodicalId\":161799,\"journal\":{\"name\":\"Logic group preprint series\",\"volume\":\"219 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic group preprint series\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1017/9781316755723.005\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic group preprint series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/9781316755723.005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In [6] an approach to proof-theoretic analysis of Peano arithmetic
based an the motion of graded provability algebra was suggested. Here we present a provability-algebraic version of the independent combinatorial Hydra battle principle. This allows for simple independence proofs of both principles based on provability-algebraic methods.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
