组合函数的可定义性及其线性递归关系

{"title":"组合函数的可定义性及其线性递归关系","authors":"Tomer Kotek, J. Makowsky","doi":"10.1007/978-3-642-15025-8_21","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":12271,"journal":{"name":"Fields of Logic and Computation III","volume":"73 1","pages":"444-462"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Definability of Combinatorial Functions and Their Linear Recurrence Relations\",\"authors\":\"Tomer Kotek, J. Makowsky\",\"doi\":\"10.1007/978-3-642-15025-8_21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":12271,\"journal\":{\"name\":\"Fields of Logic and Computation III\",\"volume\":\"73 1\",\"pages\":\"444-462\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fields of Logic and Computation III\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-15025-8_21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fields of Logic and Computation III","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-15025-8_21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}