Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-19T22:29:39.504Z Has data issue: false hasContentIssue false
  • English
  • Français

MODELS OF PT– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE

Published online by Cambridge University Press:  15 December 2016

CEZARY CIEŚLIŃSKI ,
MATEUSZ ŁEŁYK  and
BARTOSZ WCISŁO
CEZARY CIEŚLIŃSKI*
Affiliation:
Institute of Philosophy, University of Warsaw
MATEUSZ ŁEŁYK*
Affiliation:
Institute of Philosophy, University of Warsaw
BARTOSZ WCISŁO*
Affiliation:
Institute of Philosophy, University of Warsaw
*
*INSTITUTE OF PHILOSOPHY UNIVERSITY OF WARSAW WARSAW, POLAND E-mail: [email protected]
†INSTITUTE OF PHILOSOPHY UNIVERSITY OF WARSAW WARSAW, POLAND E-mail: [email protected]
‡INSTITUTE OF PHILOSOPHY UNIVERSITY OF WARSAW WARSAW, POLAND E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
The Review of Symbolic Logic , Volume 10 , Issue 1 , March 2017 , pp. 187 - 202
Copyright
Copyright © Association for Symbolic Logic 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

BIBLIOGRAPHY

Cantini, A. (1989). Notes on formal theories of truth. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 35(2), 97–130.Google Scholar
Cieśliński, C. (2015a). The innocence of truth. Dialectica, 69(1), 61–85.Google Scholar
Cieśliński, C. (2015b). Typed and untyped disquotational truth. In Achourioti, T., Galinon, H., Fujimoto, K., and Martínez-Fernández, J., editors. Unifying the Philosophy of Truth. Dordrecht: Springer, pp. 307–320.Google Scholar
Cieśliński, C. (2011). T-equivalences for positive sentences. The Review of Symbolic Logic, 4(2), 319–325.CrossRefGoogle Scholar
Fischer, M. (2009). Minimal truth and interpretability. The Review of Symbolic Logic, 2(04), 799–815.Google Scholar
Fischer, M. (2014). Truth and speed-up. The Review of Symbolic Logic, 7(2), 319–340.Google Scholar
Fischer, M. (2015). Deflationism and instrumentalism. In Achourioti, T., Galinon, H., Fujimoto, K., and Martínez-Fernández, J., editors. Unifying the Philosophy of Truth. Dordrecht: Springer, pp. 293–306.Google Scholar
Fischer, M. & Horsten, L. (2015). The expressive power of truth. The Review of Symbolic Logic, 8(2), 345–369.Google Scholar
Fujimoto, K. (2010). Relative truth definability of axiomatic truth theories. The Bulletin of Symbolic Logic, 16, 305–344.Google Scholar
Halbach, V. (2009). Reducing compositional to disquotational truth. The Review of Symbolic Logic, 2(4), 786–798.CrossRefGoogle Scholar
Halbach, V. (2011). Axiomatic Theories of Truth. Cambridge: Cambridge University Press.Google Scholar
Horsten, L. (1995). The semantical paradoxes, the neutrality of truth and the neutrality of the minimalist theory of truth. In Cartois, P., editor. The Many Problems of Realism. Studies in the General Philosophy of Science, Vol. 3. Tilburg: Tilburg University Press, pp. 173–187.Google Scholar
Kaye, R. (1991). Models of Peano Arithmetic. Oxford: Clarendon Press.Google Scholar
Ketland, J. (1999). Deflationism and Tarski’s paradise. Mind, 108(429), 69–94.CrossRefGoogle Scholar
Kossak, R. & Schmerl, J. H. (2006). The Structure of Models of Peano Arithmetic. Oxford: Clarendon Press.Google Scholar
Shapiro, S. (1998). Proof and truth: Through thick and thin. The Journal of Philosophy, 95(10), 493–521.Google Scholar
Smith, S. T. (1989). Nonstandard definability. Annals of Pure and Applied Logic, 42, 21–43.CrossRefGoogle Scholar