Previous |  Up |  Next

Article

References:
[1] IVÁNEK J.: O neaxiomatizovatelnosti observačního predikátového počtu. (Master thesis, Charles University 1976).
[2] JECH T. J.: Lectures in Set Theory with Particular Emphasis on the Method of Forcing. Lecture Notes in Mathematics 217, Springer-Verlag 1971 (Russian translationt Moskva 1973). MR 0321738 | Zbl 0236.02048
[3] MATIASEVIČ J. V.: Diofantovosť perečislimych množestv. Doklady AN SSSR (1970), 279-282.
[4] MATIASEVIČ J. V.: Diofantovo predstavlenie perečislimych predikatov. Izvestija AN SSSR, Serija matematičeskaja 35 (1971), 3-30.
[5] ROGERS H.: Theory of recursive functions and effective computability. McGraw-Hill Book Company,1967 (Russian translation: Moskva 1972). MR 0224462 | Zbl 0183.01401
[6] SHOENFIELD J. R.: Mathematical Logic. Addison-Wesley Publishing Company,1967 (Russian translation: Moskva, 1975). MR 0225631 | Zbl 0155.01102
[7] TRACHTENBROT B. A.: Nevozmožnosť algorifma dlja problemy razrešimosti na koněčnych klassach. Doklady AN SSSR 70 (1950), 569-572.
[8] TRACHTENBROT B. A.: O rekursivnoj otdělimosti. Doklady AN SSSR 88 (1953), 953-956. MR 0065492
Partner of
EuDML logo