Skip to main content
Log in

Arithmetical realizability and basic logic

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

Absolute arithmetical realizability of predicate formulas is introduced. It is proved that the intuitionistic logic is not correct with this semantics, but the basic logic is correct.

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

Access this article

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

Instant access to the full article PDF.

References

  1. S. C. Kleene, Introduction to Metamathematics (Wolters-Noordhoff, 1952; IL, Moscow, 1957).

    MATH  Google Scholar 

  2. V. E. Plisko, “Absolute Realizability of Predicate Formulas,” Izvestiya Akad. Nauk SSSR, Matem. 47 (2), 315 (1983).

    MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. S. Salehi, “Primitive Recursive Realizability and Basic Arithmetic,” Bull. Symbol. Logic 7 (1), 147 (2001).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Yu. Konovalov.

Additional information

Original Russian Text © A. Y-u. Konovalov, 2016, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2016, Vol. 71, No. 1, pp. 52-56.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Konovalov, A.Y. Arithmetical realizability and basic logic. Moscow Univ. Math. Bull. 71, 35–38 (2016). https://doi.org/10.3103/S0027132216010071

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation