Skip to main content
SpringerLink
Log in

Arithmetical realizability and primitive recursive realizability

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The semantics of the predicate logic based on the absolute arithmetical realizability is proved to differ from the semantics based on the primitive recursive realizability by Salehi.

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. S. Salehi, “Primitive Recursive Realizability and Basic Arithmetic,” Bull. Symbol. Logic 7 (1), 147 (2001).

    Google Scholar 

  2. S. Salehi, “Provably Total Functions of Basic Arithmetic,” Math. Log. Quart. 49 (3), 316 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  3. W. Ruitenburg, “Basic Predicate Calculus,” Notre Dame J. Form. Log. 39 (1), 18 (1998).

    Article  MathSciNet  MATH  Google Scholar 

  4. A. Yu. Konovalov, “Arithmetical Realizability and Basic Logic,” Vestn. Mosk. Univ., Matem. Mekhan., 1, 52 (2016) [Moscow Univ. Math. Bulletin 71 (1), 35 (2016)].

    MathSciNet  MATH  Google Scholar 

  5. M. Ardeshir, “A Translation of Intuitionistic Predicate Logic into Basic Predicate Logic,” Stud. Log. 62, 341 (1999).

    Article  MathSciNet  MATH  Google Scholar 

  6. D. A. Viter, Primitive Recursive Realizability and Predicate Logic, Available from VINITI, 1830–V2001 (Moscow, 2001).

    Google Scholar 

  7. D. A. Viter, Primitive Recursive Realizability and Constructive Model Theory, Candidate’s Dissertation in Mathematics and Physics (Moscow State Univ., Moscow, 2001).

    Google Scholar 

  8. S. K. Kleene, Introduction to Metamathematics (IL, Moscow, 1957; Ishi Press Int., N.Y., 2009).

    MATH  Google Scholar 

  9. V. E. Plisko, “Absolute Realizability of Predicate Formulas,” Izvestiya Akad. Nauk SSSR, Ser. Matem. 47 (2), 315 (1983) [Math. of the USSR–Izvestiya 22 (2), 291 (1984)].

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Faculty of Mechanics and Mathematics, Leninskie Gory, Moscow, 119991, Russia

    A. Yu. Konovalov

Authors
  1. A. Yu. Konovalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Yu. Konovalov.

Additional information

Original Russian Text © A.Yu. Konovalov, 2016, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2016, Vol. 71, No. 4, pp. 60–64.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Konovalov, A.Y. Arithmetical realizability and primitive recursive realizability. Moscow Univ. Math. Bull. 71, 166–169 (2016). https://doi.org/10.3103/S0027132216040069

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132216040069

Search

Navigation