A system of complete and consistent truth
type: Item
instance of: scholarly article
title: A system of complete and consistent truth
zbMATH Open document ID: 0828.03030
author: Volker Halbach
published in: Notre Dame Journal of Formal Logic
publication date: 1995-12-18T00:00:00Z
review text: The system FS (in honor of Friedman and Sheard, according to the author) is obtained from PA (= Peano arithmetic with all the primitive recursive functions) by adding the truth predicate \(T(\;)\). New axioms dictate that \(T\) commutes with quantifiers and connectives, and new rules are: from \(\varphi\), infer \(T\varphi\); and, conversely, from \(T \varphi\), infer \(\varphi\). [Here and below, sentences, their Gödel numbers, and their numerals are written the same.] By model theory, the author shows that FS is consistent but is \(\omega\)-inconsistent. He also considers RT, the theory of ramified truth, that has \(T_n(\;)\) for all \(n \in \mathbb{N}\), and the axiom \(T_n T_k \varphi \leftrightarrow T_n \varphi\) for \(k < n\). Both FS and RT are filtrated. Namely, in \(\text{FS}_n\) the new rules are applied less than \(n\) times, and in \(\text{RT}_n\), \(T_k\) can be used only if \(k < n\). A stage-by-stage comparison is given. Roughly, \(\text{RT}_n \vdash \varphi\) then \(\text{FS}_n \vdash h_n (\varphi)\), and \(\text{FS}_n \vdash \psi\) then \(\text{RT}_{2n} \vdash g_n (\psi)\), where \(h_n\) and \(g_n\) translate one language into the other. From this, the author shows that FS is arithmetically sound (despite its \(\omega\)-inconsistency), and is conservative over PA if the induction axioms are restricted to arithmetical formulas. He also considers global translations between FS and RT.
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03B30
zbMATH DE Number: 769226
zbMATH Keywords: \(\omega\)-consistency
zbMATH Keywords: Peano arithmetic
zbMATH Keywords: truth predicate
zbMATH Keywords: ramified truth
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1040511340
OpenAlex ID: W2111411333
cites work: Q4845457
cites work: Systems of predicative analysis
cites work: Hilbert's program relativized; Proof-theoretical and foundational reductions
cites work: Reflecting on incompleteness
cites work: An axiomatic approach to self-referential truth
cites work: Truth and paradox
cites work: Notes on naive semantics
cites work: Construction of Satisfaction Classes for Nonstandard Models
cites work: How truthlike can a predicate be? A negative result
cites work: Relative Interpretations
DOI: 10.1305/NDJFL/1040511340
description: scientific article; zbMATH DE number 769226