{"title":"The provability logic of all provability predicates","authors":"Taishi Kurahashi","doi":"10.1093/logcom/exad060","DOIUrl":null,"url":null,"abstract":"Abstract We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczyński’s pure logic of necessitation $\\textsf{N}$. Moreover, we introduce three extensions $\\textsf{N4}$, $\\textsf{NR}$ and $\\textsf{NR4}$ of $\\textsf{N}$ and investigate the arithmetical semantics of these logics. In fact, we prove that $\\textsf{N4}$, $\\textsf{NR}$ and $\\textsf{NR4}$ are the provability logics of all provability predicates satisfying the third condition $\\textbf{D3}$ of the derivability conditions, all Rosser provability predicates and all Rosser provability predicates satisfying $\\textbf{D3}$, respectively.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"12 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/logcom/exad060","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczyński’s pure logic of necessitation $\textsf{N}$. Moreover, we introduce three extensions $\textsf{N4}$, $\textsf{NR}$ and $\textsf{NR4}$ of $\textsf{N}$ and investigate the arithmetical semantics of these logics. In fact, we prove that $\textsf{N4}$, $\textsf{NR}$ and $\textsf{NR4}$ are the provability logics of all provability predicates satisfying the third condition $\textbf{D3}$ of the derivability conditions, all Rosser provability predicates and all Rosser provability predicates satisfying $\textbf{D3}$, respectively.
期刊介绍:
Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging.
The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.