Lokalʹnai︠a︡ teorii︠a︡ stepeneĭ nerazreshimosti i [Delta ⁰2 in column] - mnozhestva

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

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,010

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

Rekursivno perechislimye mnozhestva i stepeni nerazreshimosti.M. M. Arslanov - 1986 - Kazanʹ: Izdatelʹstvo Kazanskogo universiteta.
An invariance notion in recursion theory.Robert E. Byerly - 1982 - Journal of Symbolic Logic 47 (1):48-66.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
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.
A theory of rules for enumerated classes of functions.Andreas Schlüter - 1995 - Archive for Mathematical Logic 34 (1):47-63.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.

Analytics

Added to PP
2023-05-25

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