Skip to main content

Infinite Liar in a (Modal) Finitistic Setting

  • Conference paper
  • First Online:
Logic and Its Applications (ICLA 2019)

Abstract

Yablo’s paradox results in a set of formulas which (with local disquotation in the background) turns out consistent, but \(\omega \)-inconsistent. Adding either uniform disquotation or the \(\omega \)-rule results in inconsistency. One might think that it doesn’t arise in finitary contexts. We study whether it does. It turns out that the issue turns on how the finitistic approach is formalized.

This research has been supported by the FWO postdoctoral research grant and the National Science Centre SONATA BIS research grant number 2016/22/E/HS1/00304. The second author has been supported by the National Science Centre OPUS research grant number 2014/13/B/HS1/02892.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The methods we develop here – especially the semantics of quantifiers in FM-domains – is similar to the framework of modal potentialism developed independently in [2].

References

  1. Godziszewski, M.T.: Yablo sequences in potentially infinite domains and partial semantics (2018). [submitted]

    Google Scholar 

  2. Hamkins, J.D., Linnebo, Ø.: The modal logic of set-theoretic potentialism and the potentialist maximality principles. Rev. Symb. Logic (2018, to appear). http://wp.me/p5M0LV-1zC, arXiv:1708.01644

  3. Ketland, J.: Yablo’s paradox and \(\omega \)-inconsistency. Synthese 145, 295–302 (2005)

    Article  MathSciNet  Google Scholar 

  4. Mostowski, M.: On representing concepts in finite models. Math. Logic Q. 47, 513–523 (2001)

    Article  MathSciNet  Google Scholar 

  5. Mostowski, M.: On representing semantics in finite models. In: Rojszczak, A., Cachro, J., Kurczewsk, G. (eds.) Philosophical Dimensions of Logic and Science, pp. 15–28. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  6. Mostowski, M., Zdanowski, K.: FM-representability and beyond. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 358–367. Springer, Heidelberg (2005). https://doi.org/10.1007/11494645_45

    Chapter  Google Scholar 

  7. Mostowski, M.: Truth in the limit. Rep. Mathe. Logic 51, 75–89 (2016)

    MathSciNet  MATH  Google Scholar 

  8. Priest, G.: Yablo’s paradox. Analysis 57, 236–242 (1997)

    Article  MathSciNet  Google Scholar 

  9. Urbaniak, R.: Potential infinity, abstraction principles and arithmetic (Leśniewski style). Axioms 5(2), 18 (2016)

    Article  Google Scholar 

  10. Yablo, S.: Paradox without self-reference. Analysis 53, 251–252 (1993)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rafal Urbaniak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer-Verlag GmbH Germany, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Godziszewski, M.T., Urbaniak, R. (2019). Infinite Liar in a (Modal) Finitistic Setting. In: Khan, M., Manuel, A. (eds) Logic and Its Applications. ICLA 2019. Lecture Notes in Computer Science(), vol 11600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-58771-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-58771-3_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-58770-6

  • Online ISBN: 978-3-662-58771-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics