Search results

Post E.L. [1947] Recursive unsolvability of a problem of Thue J. Symbolic Logic, 12, № 1, 1-11 ~ ROS article Вернуться к поиску

Post E.L. [1946] Note on a conjecture of Skolem J. Symbolic Logic, 11, № 3, 73-74 ~ RS article Вернуться к поиску

Post E.L. [1946] A variant of a recursively unsolvable problem Bull. Amer. Math. Soc., 52, № 4, 264-268 ~ article Вернуться к поиску

Post E.L. [1943] Formal reductions of the general combinatorial decision problem Amer. J. Math., 65, № 2, 197-215 ~ ROS article Вернуться к поиску

Post E.L. [1936] Finite combinatory processes. Formulation, I J. Symbolic Logic, 1, № 3, 103-105 (Русский перевод в книге В.А.Успенского “ Машины Поста”, М., Наука, 1979, 83-88.) ~ ROS article Вернуться ...

Post E.L. [1944] Recursively enumerable sets of positive integers and their decision problems Bull. Amer. Math. Soc., 50, № 5, 284-316 ~ REOS article Вернуться к поиску

Kleene S.C., Post E.L. [1954] The upper semilattice of degrees of recursive unsolvability. Ann. Math., 59, № 3, 379-407 56. 1910 ROS article Вернуться к поиску

Post E.L. [1965] Absolutely unsolvable problems and relatively undecidable propositions The Undecidable. Basic papers on undecidable propositions, Unsolvable Problems and Computable Functions, Raven Press, 340-433 ? article Вернуться к поиску

Cooper S.B. [2001] On a conjecture of Kleene and Post Math. Logic Quarterly, 47, № 1, 3-33 ? O article Вернуться к поиску

Sacks G.E. [1966] Post’s problem, admissible ordinals and regularity Trans. Amer. Math. Soc., 124, № 1, 1-23 68.01.69 OS article Вернуться к поиску

Kučera A. [1986] An alternative, priority-free solution to Post's problem Lect. Notes. in Comp. Sci., 233, 493-500, Springer -Verlag ? OS article Вернуться к поиску

Lavrov I.A. [1979] Retracts of Post’s numbering and effectivization of quantifiers Essays on Math., Phil. Logic, D.Reidel Publ.Com., 287-294 ? article Вернуться к поиску

Harrington L. A., Soare R.I. [1991] Post’s program and incomplete recursively enumerable sets Proc. Nat. Acad. Sci., USA, 88, № 22 , 10242-10246 ? O article Вернуться к поиску

Afshari B., Barmpalias G., Cooper S.B., Stephan F. [2007] Post’s program for the Erchov hierarchy J. Logic and Comp., 17, № 6, 1025-1040 ? article Вернуться к поиску

Ambos-Spies K., Nies A. [1992] Cappable recursively enumerable degrees and Post's program Arch. Math. Logik Grundl., 32, № 1, 51-56 94.01.41 O article Вернуться к поиску

Jockusch C.G. Jr., Soare R.I. [1973] Post's problem and his hypersimple set J. Symbolic Logic, 38, № 3, 446-452 74.07.119 OS article Вернуться к поиску

Cohen P.F., Jockusch C. G. Jr. [1975] A lattice property of Post’s simple sets Ill. J. Math. 19 , № 3, 450-453 77.04.56 OS article Вернуться к поиску

Simpson S.G. [1974] Post's problem for admissible sets General Recursion Theory, II, Proc. Symp. (Oslo, 1974), 437-441, North Holland 75.05.79 O article Вернуться к поиску

P Palmgren E. ParisJB Parsons Ch. Paterson M.S. Payne T.H. Peretyat’kin M.G. Peter R. Pillay A. Pingrey S. Pleszkoch M. Podzorov S.Yu. Posner D.B. Post E.L. Poudestone W. Pour-El M. B. Presburger M. Putnam H. Puzarenko V.G. Вернуться на главную страницу

Minsky M.L. [1961] Recursive unsolvability of Post’s problem of “Tag” and other topics in theory of Turing machines Ann. Math., 74, № 3, 437-455 63.01.74 OS article Вернуться к поиску

Sacks G.E. [1985] Post’s problem in E -recursion Proc. Summer Institute on Recursive Theory (Ithaca, New York), 42, Amer. Math. Soc., Ass. Symbolic Logic, 177-193 86.03.46 S article Вернуться к поиску

Friedberg R.M. [1957] Two recursively enumerable sets of incomparable degrees of unsolvability (solution of Post’s problem 1944) Proc. Nat. Acad. Sci., USA, 43, № 2, 236-238 58.1769 ROS article Вернуться к поиску