Skip to main content
SpringerLink
Log in

Notes on the Computational Aspects of Kripke’s Theory of Truth

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Burgess, J. P., The truth is never simple, Journal of Symbolic Logic 51(4):663–681, 1986. Doi:10.2307/2274021

    Article  Google Scholar 

  2. Cain, J., and Z. Damnjanovic, On the weak Kleene scheme in Kripke’s theory of Truth, Journal of Symbolic Logic 56(4):1452–1468, 1991. Doi:10.2307/2275486

    Article  Google Scholar 

  3. Fischer, M., V. Halbach, J. Kriener, and J. Stern, Axiomatizing semantic theories of truth? Review of Symbolic Logic 8(2):257–278, 2015. Doi:10.1017/S1755020314000379

    Article  Google Scholar 

  4. Hájek, P., and P. Pudlák, Metamathematics of First-Order Arithmetic, Springer, 1993.

  5. Feferman, S., Axioms for determinateness and truth, Review of Symbolic Logic 1(2):204–217, 2008. Doi:10.1017/S1755020308080209

    Article  Google Scholar 

  6. Fitting, M., A theory of truth that prefers falsehood, Journal of Philosophical Logic 26(5):477–500, 1997. Doi:10.1023/A:1004217812355

    Article  Google Scholar 

  7. Halpern, J. Y., Presburger arithmetic with unary predicates is \(\Pi _1^1\) complete, Journal of Symbolic Logic 56(2):637–642, 1991. Doi:10.2307/2274706

    Article  Google Scholar 

  8. Kripke, S., Outline of a theory of truth, The Journal of Philosophy 72(19):690–716, 1991. Doi:10.2307/2024634

    Article  Google Scholar 

  9. Leitgeb, H., What truth depends on, Journal of Philosophical Logic 34(2):155–192, 2005. Doi:10.1007/s10992-004-3758-3

    Article  Google Scholar 

  10. Magidor, O., Category Mistakes, Oxford University Press, 2013.

  11. Matiyasevich, Y. V., Hilbert’s Tenth Problem, MIT Press, 1993.

  12. Meadows, T., Infinitary tableau for semantic truth, Review of Symbolic Logic 8(2):207–235, 2015. Doi:10.1017/S175502031500012X

    Article  Google Scholar 

  13. Meadows, T., Truth, dependence and supervaluation: living with the ghost, Journal of Philosophical Logic 42(2):221–240, 2013. Doi:10.1007/s10992-011-9219-x

    Article  Google Scholar 

  14. Moschovakis, Y. N., Elementary Induction on Abstract Structures, North-Holland Publishing Company, 1974.

  15. Rogers, H., Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, 1967.

  16. Sacks, G. E., Higher Recursion Theory, Springer, 1990.

  17. Schindler, T., Type-Free Truth (PhD Thesis). Ludwig-Maximilians-Universität München, 2015. Available online at https://edoc.ub.uni-muenchen.de/18335/

  18. Speranski, S. O., A note on definability in fragments of arithmetic with free unary predicates, Archive for Mathematical Logic 52(5–6):507–516, 2013. Doi:10.1007/s00153-013-0328-9

    Article  Google Scholar 

  19. Speranski, S. O., Some new results in monadic second-order arithmetic, Computability 4(2):159–174, 2015. Doi:10.3233/COM-150036

    Article  Google Scholar 

  20. Welch, P. D., The complexity of the dependence operator, Journal of Philosophical Logic 44(3):337–340, 2014. Doi:10.1007/s10992-014-9324-8

Download references

Author information

Authors and Affiliations

  1. St. Petersburg State University, 29B Line 14th, Vasilyevsky Island, St. Petersburg, Russia, 199178

    Stanislav O. Speranski

Authors
  1. Stanislav O. Speranski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stanislav O. Speranski.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Speranski, S.O. Notes on the Computational Aspects of Kripke’s Theory of Truth. Stud Logica 105, 407–429 (2017). https://doi.org/10.1007/s11225-016-9694-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-016-9694-8

Keywords

Search

Navigation