Occurence of contradictions in Zermelo–Fraenkel theory under extension of base language by recursion functions

Koganov A.V.
 pdf (166K)  / List of references

It is shown that the extension of base language in Zermelo–Fraenkel theory, which allows a relations on recursion function of natural argument, may lead in Set Theory to contradictive constructions on arithmetic level.

Keywords: Zermelo–Fraenkel theory, recursion functions, set theory
Citation in English: Koganov A.V. Occurence of contradictions in Zermelo–Fraenkel theory under extension of base language by recursion functions // Computer Research and Modeling, 2009, vol. 1, no. 4, pp. 367-380
Citation in English: Koganov A.V. Occurence of contradictions in Zermelo–Fraenkel theory under extension of base language by recursion functions // Computer Research and Modeling, 2009, vol. 1, no. 4, pp. 367-380
DOI: 10.20537/2076-7633-2009-1-4-367-380
URL: http://crm-en.ics.org.ru/journal/article/1598/
Creative Commons License This work is licensed under a Creative Commons Attribution-NoDerivs 3.0 Unported License.
According to Crossref, this article is cited by:
  • Vladimir V. Belov, Aleksandr K. Lopatin. Automated Approach for Product Sizes Measurement on the Conveyor Belt. // ITM Web of Conferences. — 2017. — V. 10. — P. 01002. DOI: 10.1051/itmconf/20171001002
Please note that citation information may be incomplete as it includes data from Crossref cited-by program partners only.
Views (last year): 1. Citations: 2 (RSCI).

Indexed in Scopus

Full-text version of the journal is also available on the web site of the scientific electronic library eLIBRARY.RU

The journal is included in the Russian Science Citation Index

The journal is included in the RSCI

International Interdisciplinary Conference "Mathematics. Computing. Education"

Copyright © 2009–2024 Institute of Computer Science