Rekursivno perechislimye mnozhestva i stepeni nerazreshimosti

Kazanʹ: Izdatelʹstvo Kazanskogo universiteta (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Minimal weak truth table degrees and computably enumerable Turing degrees.R. G. Downey - 2020 - Providence, RI: American Mathematical Society. Edited by Keng Meng Ng & Reed Solomon.
Mathematical logic and foundations of set theory.Yehoshua Bar-Hillel (ed.) - 1970 - Amsterdam,: North-Holland Pub. Co..
The structure of the honest polynomial m-degrees.Rod Downey, William Gasarch & Michael Moses - 1994 - Annals of Pure and Applied Logic 70 (2):113-139.

Analytics

Added to PP
2023-05-26

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references