{"title":"命题证明的复杂性","authors":"Nathan Segerlind","doi":"10.2178/bsl/1203350879","DOIUrl":null,"url":null,"abstract":"Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"79","resultStr":"{\"title\":\"The Complexity of Propositional Proofs\",\"authors\":\"Nathan Segerlind\",\"doi\":\"10.2178/bsl/1203350879\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.\",\"PeriodicalId\":55307,\"journal\":{\"name\":\"Bulletin of Symbolic Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2007-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"79\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Symbolic Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2178/bsl/1203350879\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2178/bsl/1203350879","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}
Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
期刊介绍：
The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
