{"title":"Classical determinate truth without induction","authors":"Bartosz Wcisło","doi":"arxiv-2408.01198","DOIUrl":null,"url":null,"abstract":"Fujimoto and Halbach had introduced a novel theory of type-free truth CD\nwhich satisfies full classical compositional clauses for connectives and\nquantifiers. Answering their question, we show that the induction-free variant\nof that theory is conservative over Peano Arithmetic.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.01198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Fujimoto and Halbach had introduced a novel theory of type-free truth CD
which satisfies full classical compositional clauses for connectives and
quantifiers. Answering their question, we show that the induction-free variant
of that theory is conservative over Peano Arithmetic.