Email this article The semantics of realizability for the constructive set theory based on hyperarithmetical predicates
- Authors: Konovalov A.Y.1
-
Affiliations:
- Moscow State University
- Issue: Vol 72, No 3 (2017)
- Pages: 129-132
- Section: Brief Communications
- URL: https://journal-vniispk.ru/0027-1322/article/view/164528
- DOI: https://doi.org/10.3103/S0027132217030068
- ID: 164528
Cite item
Open Access
Access granted
Subscription Access
Abstract
A semantics of realizability based on hyperarithmetical predicates of membership is introduced for formulas of the language of set theory. It is proved that the constructive set theory without the extensionality axiom is sound with this semantics.
About the authors
A. Yu. Konovalov
Moscow State University
Author for correspondence.
Email: alexandr.konoval@gmail.com
Russian Federation, Leninskie Gory, Moscow, 119991
Supplementary files
