2016
DOI: 10.1017/s1755020316000356
|View full text |Cite
|
Sign up to set email alerts
|

MODELS OF PTWITH INTERNAL INDUCTION FOR TOTAL FORMULAE

Abstract: We show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PTtot) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PTtot contains every recursively saturated model of arithmetic. Our results point to a gap in the philosophical project of describing the use of the truth predicate in model-theoretic contexts.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
32
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
1
1

Relationship

4
1

Authors

Journals

citations
Cited by 5 publications
(32 citation statements)
references
References 17 publications
0
32
0
Order By: Relevance
“…This is the unique way of using · in this paper. 4. to enhance readability we suppress the formulae representing the syntactic operations.…”
Section: Compositional Positive Truth and Its Extensionsmentioning
confidence: 99%
See 4 more Smart Citations
“…This is the unique way of using · in this paper. 4. to enhance readability we suppress the formulae representing the syntactic operations.…”
Section: Compositional Positive Truth and Its Extensionsmentioning
confidence: 99%
“…And UTB to be the extensions of UTB − with all instantiations of induction scheme with L T formulae. In [6], [7] and [8] (this last philosophical motivation was summarized also in [4]) authors motivated the need for a weak theory of truth which would be able to prove in a single sentence the fact that every arithmetical formula satisfy the induction scheme. Such a fact can be naturally expressed by an L T sentence…”
Section: Compositional Positive Truth and Its Extensionsmentioning
confidence: 99%
See 3 more Smart Citations