{"title":"证明逻辑尖锐模型中术语的规范化 LP","authors":"","doi":"10.3103/s0027132223060049","DOIUrl":null,"url":null,"abstract":"<span> <h3>Abstract</h3> <p>A basic justification model is sharp when the evidence term constructors <span> <span>\\(\\cdot,+,!\\)</span> </span> in it mean exactly the application of modus ponens rule, the union and the verification of evidences. We construct an example of a sharp model for the logic of proofs <span>LP</span> and establish that in any sharp model of <span>LP</span> every proof term is equivalent to some proof polynomial.</p> </span>","PeriodicalId":42963,"journal":{"name":"Moscow University Mathematics Bulletin","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Normalization of Terms in Sharp Models of Logic of Proofs LP\",\"authors\":\"\",\"doi\":\"10.3103/s0027132223060049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<span> <h3>Abstract</h3> <p>A basic justification model is sharp when the evidence term constructors <span> <span>\\\\(\\\\cdot,+,!\\\\)</span> </span> in it mean exactly the application of modus ponens rule, the union and the verification of evidences. We construct an example of a sharp model for the logic of proofs <span>LP</span> and establish that in any sharp model of <span>LP</span> every proof term is equivalent to some proof polynomial.</p> </span>\",\"PeriodicalId\":42963,\"journal\":{\"name\":\"Moscow University Mathematics Bulletin\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2023-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Moscow University Mathematics Bulletin\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3103/s0027132223060049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Moscow University Mathematics Bulletin","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3103/s0027132223060049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
Normalization of Terms in Sharp Models of Logic of Proofs LP
Abstract
A basic justification model is sharp when the evidence term constructors \(\cdot,+,!\) in it mean exactly the application of modus ponens rule, the union and the verification of evidences. We construct an example of a sharp model for the logic of proofs LP and establish that in any sharp model of LP every proof term is equivalent to some proof polynomial.
期刊介绍:
Moscow University Mathematics Bulletin is the journal of scientific publications reflecting the most important areas of mathematical studies at Lomonosov Moscow State University. The journal covers research in theory of functions, functional analysis, algebra, geometry, topology, ordinary and partial differential equations, probability theory, stochastic processes, mathematical statistics, optimal control, number theory, mathematical logic, theory of algorithms, discrete mathematics and computational mathematics.