Search results
- Odifreddi, Classical Recursion Theory (1989), p.378. North-Holland, 0-444-87295-7 P. D. Welch, "Weak Systems of Determinacy and Arithmetical Quasi-Inductive...10 KB (1,673 words) - 16:23, 24 June 2024
- Foundations of Mathematics. Vol. 125. Amsterdam: North Holland. ISBN 0-444-87295-7. Zbl 0661.03029. Nies, André (2009). Computability and randomness. Oxford...4 KB (539 words) - 22:45, 1 June 2021
- Logic and the Foundations of Mathematics, vol. 125 (1989), Elsevier 0-444-87295-7. Dekker, J. C. E. (September 1957). "J. Myhill and J. C. Shepherdson...8 KB (1,124 words) - 00:39, 2 July 2024
- Odifreddi, Classical Recursion Theory (1989) p.421. North-Holland, 0-444-87295-7 Devlin, Keith J. (1984). Constructibility. Berlin: Springer-Verlag....8 KB (1,321 words) - 12:19, 1 January 2024
- Odifreddi, P. (1999). Classical Recursion Theory. North-Holland. ISBN 0-444-87295-7. Rogers, H. (1987) [1967]. The Theory of Recursive Functions and Effective...8 KB (1,212 words) - 22:02, 18 January 2024
Odifreddi, Classical Recursion Theory (1989), p.8. North-Holland, 0-444-87295-7 Turing (1936). Minsky (1967). Rice (1954). Bridges & Richman (1987)...24 KB (3,263 words) - 06:14, 11 August 2024- P. Odifreddi, 1989. Classical Recursion Theory, North-Holland. ISBN 0-444-87295-7 P. Odifreddi, 1999. Classical Recursion Theory, Volume II, Elsevier...13 KB (1,982 words) - 04:46, 16 September 2023
- Logic and the Foundations of Mathematics, vol. 125 (1989), Elsevier 0-444-87295-7. S. Ahmad, Embedding the Diamond in the Σ 2 {\displaystyle \Sigma _{2}}...12 KB (1,763 words) - 03:50, 7 June 2024
- Piergiorgio (1989). Classical Recursion Theory. North-Holland. ISBN 0-444-87295-7. Odifreddi, Piergiorgio (1999). Classical Recursion Theory. Vol. II...54 KB (6,419 words) - 10:46, 16 July 2024
