{"title":"Provably Total Functions of Arithmetic with Basic Terms","authors":"E. Makarov","doi":"10.4204/EPTCS.75.3","DOIUrl":null,"url":null,"abstract":"A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and existential introduction.","PeriodicalId":35380,"journal":{"name":"CESifo DICE Report","volume":"28 1","pages":"28-32"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"CESifo DICE Report","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.75.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Economics, Econometrics and Finance","Score":null,"Total":0}
引用次数: 0
Abstract
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and existential introduction.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
