{"title":"关于BCK(2)-项的渐近数","authors":"O. Bodini, Bernhard Gittenberger","doi":"10.1137/1.9781611973204.3","DOIUrl":null,"url":null,"abstract":"We investigate the asymptotic number of a particular class of closed lambda-terms. This class is a generalization of a class of terms related to the axiom system BCK which is well known in combinatory logic. We determine the asymptotic number of terms, when their size tends to infinity, up to a constant multiplicative factor and discover a surprising asymptotic behaviour involving an exponential with fractional powers in the exponent.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On the asymptotic number of BCK(2)-terms\",\"authors\":\"O. Bodini, Bernhard Gittenberger\",\"doi\":\"10.1137/1.9781611973204.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the asymptotic number of a particular class of closed lambda-terms. This class is a generalization of a class of terms related to the axiom system BCK which is well known in combinatory logic. We determine the asymptotic number of terms, when their size tends to infinity, up to a constant multiplicative factor and discover a surprising asymptotic behaviour involving an exponential with fractional powers in the exponent.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-01-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611973204.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973204.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We investigate the asymptotic number of a particular class of closed lambda-terms. This class is a generalization of a class of terms related to the axiom system BCK which is well known in combinatory logic. We determine the asymptotic number of terms, when their size tends to infinity, up to a constant multiplicative factor and discover a surprising asymptotic behaviour involving an exponential with fractional powers in the exponent.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
