{"title":"可证明性，复杂性，语法","authors":"L. Beklemishev, M. Pentus, N. Vereshchagin","doi":"10.1090/trans2/192","DOIUrl":null,"url":null,"abstract":"Classification of propositional provability logics by L. D. Beklemishev Lambek calculus and formal grammars by M. Pentus Relativizability in complexity theory by N. K. Vereshchagin.","PeriodicalId":275087,"journal":{"name":"American Mathematical Society translations series 2","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Provability, complexity, grammars\",\"authors\":\"L. Beklemishev, M. Pentus, N. Vereshchagin\",\"doi\":\"10.1090/trans2/192\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Classification of propositional provability logics by L. D. Beklemishev Lambek calculus and formal grammars by M. Pentus Relativizability in complexity theory by N. K. Vereshchagin.\",\"PeriodicalId\":275087,\"journal\":{\"name\":\"American Mathematical Society translations series 2\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"American Mathematical Society translations series 2\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/trans2/192\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"American Mathematical Society translations series 2","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/trans2/192","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
摘要
L. D. Beklemishev对命题可证明性逻辑的分类:Lambek演算和M. Pentus对形式语法的分类。
Classification of propositional provability logics by L. D. Beklemishev Lambek calculus and formal grammars by M. Pentus Relativizability in complexity theory by N. K. Vereshchagin.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
