Skip to main content

A Remark on a Relational Version of Robinson’s Arithmetic Q

  • Chapter
Romanian Studies in Philosophy of Science

Part of the book series: Boston Studies in the Philosophy and History of Science ((BSPS,volume 313))

  • 480 Accesses

Abstract

Robinson’s arithmetic Q is given a simple interpretation in Hájek’s weaker relational version Q H that does not use Solovay’s technique of shortening cuts. The result is placed within two research themes regarding relational arithmetics.

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
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    I neglect the last axiom of the ‘official’ version of Q H, which is simply a notational convention regarding the relational symbol ‘≤’. See (Švejdar 2007) for an account of how the study of relational versions of Q was initiated and (Ganea 2009; Švejdar 2009a) for the links between these theories and the theories of concatenation TC and F. It is interesting to note that the events described by Švejdar apparently had no direct connection with the Willard-Solovay correspondence regarding the link between relational theories and the second incompleteness theorem.

References

  • Feferman S (1957) Degrees of unsolvability associated with classes of formalized theories. J Symb Log 22:161–175

    Article  Google Scholar 

  • Ganea M (2009) Arithmetic on semigroups. J Symb Log 74(1):265–278

    Article  Google Scholar 

  • Hájek P, Pudlák P (1991) Metamathematics of first-order arithmetic, Perspectives in mathematical logic. Springer, Berlin

    Google Scholar 

  • Hart WD (2010) The evolution of logic. Cambridge University Press, Cambridge, UK

    Book  Google Scholar 

  • Kossak R, Schmerl J (2006) The structure of models of Peano arithmetic, vol 50, Oxford logic guides. Clarendon, Oxford

    Book  Google Scholar 

  • Mendelson E (2001) Introduction to mathematical logic, 4th edn. CRC Press, Boca Raton

    Google Scholar 

  • Peretyat’kin M (1997) Finitely axiomatizable theories. Plenum, New York

    Google Scholar 

  • Švejdar V (2007) An interpretation of Robinson arithmetic in its Grzegorczyk’s weaker variant. Fundamenta Informaticae 81:347–354

    Google Scholar 

  • Švejdar V (2009a) Relatives of Robinson arithmetic. In: Peliš M (ed) The Logica yearbook 2008. College Publications, London, pp 253–263

    Google Scholar 

  • Švejdar V (2009b) On interpretability in the theory of concatenation. Notre Dame J Form Log 50(1):87–95

    Article  Google Scholar 

  • Willard E (2005) An exploration of the partial respects in which an axiom system recognizing only addition as a total function can verify its own consistency. J Symb Log 70(4):1171–1209

    Article  Google Scholar 

  • Willard E (2006) A generalization of the second incompleteness theorem and some exceptions to it. Ann Pure Appl Log 141:472–496

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mihai Ganea .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ganea, M. (2015). A Remark on a Relational Version of Robinson’s Arithmetic Q . In: Pȃrvu, I., Sandu, G., Toader, I. (eds) Romanian Studies in Philosophy of Science. Boston Studies in the Philosophy and History of Science, vol 313. Springer, Cham. https://doi.org/10.1007/978-3-319-16655-1_8

Download citation

Publish with us

Policies and ethics