Hostname: page-component-76c49bb84f-lvrpm Total loading time: 0 Render date: 2025-07-13T13:23:45.700Z Has data issue: false hasContentIssue false
  • English
  • Français

T-EQUIVALENCES FOR POSITIVE SENTENCES

Published online by Cambridge University Press:  23 May 2011

CEZARY CIEŚLIŃSKI
CEZARY CIEŚLIŃSKI*
Affiliation:
Institute of Philosophy, The University of Warsaw
*
*INSTITUTE OF PHILOSOPHY THE UNIVERSITY OF WARSAW POLAND. E-mail:c.cieslinski@poczta.uw.edu.pl
Get access Rights & Permissions [Opens in a new window]

Abstract

Answering a question formulated by Halbach (2009), I show that a disquotational truth theory, which takes as axioms all positive substitutions of the sentential T-schema, together with all instances of induction in the language with the truth predicate, is conservative over its syntactical base.

Information

Type
Research Article
Information
The Review of Symbolic Logic , Volume 4 , Issue 2 , June 2011 , pp. 319 - 325
Copyright
Copyright © Association for Symbolic Logic 2011

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.)

Article purchase

Temporarily unavailable

References

BIBLIOGRAPHY

Feferman, S. (1991). Reflecting on incompleteness. Journal of Symbolic Logic, 56, 1–49.CrossRefGoogle Scholar
Halbach, V. (2001). Disquotational truth and analyticity. Journal of Symbolic Logic, 66, 1959–1973.CrossRefGoogle Scholar
Halbach, V. (2009). Reducing compositional to disquotational truth. Review of Symbolic Logic, 2, 786–798.CrossRefGoogle Scholar
Kaye, R. (1991). Models of Peano Arithmetic. Oxford, UK: Clarendon Press, Oxford.CrossRefGoogle Scholar
Kossak, R., & Schmerl, J. (2006). The Structure of Models of Peano Arithmetic. Oxford, UK: Clarendon Press, Oxford.CrossRefGoogle Scholar
Kripke, S. (1975). Outline of a theory of truth. Journal of Philosophy, 72, 690–712.CrossRefGoogle Scholar
McGee, V. (1992). Maximal consistent sets of instances of Tarski’s schema (T). Journal of Philosophical Logic, 21, 235–241.CrossRefGoogle Scholar
Smorynski, C. (1981). Recursively Saturated Nonstandard Models of Arithmetic. Journal of Symbolic Logic 46, 259–286.CrossRefGoogle Scholar