Order:
Order
- The weak truth table degrees of recursively enumerable sets.Richard E. Ladner & Leonard P. Sasso - 1975 - Annals of Mathematical Logic 8 (4):429-448.details
- A minimal degree not realizing least possible jump.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):571-574.details
- A cornucopia of minimal degrees.Leonard P. Sasso - 1970 - Journal of Symbolic Logic 35 (3):383-388.details
- A survey of partial degrees.Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (2):130-140.details
- John Myhill. Note on degrees of partial functions. Proceedings of the American Mathematical Society, vol. 12 , pp. 519–521. [REVIEW]Leonard P. Sasso - 1972 - Journal of Symbolic Logic 37 (2):408.details
- Joseph R. Shoenfield. Degrees of unsolvability. North-Holland mathematical studies 2. North-Holland Publishing Company, Amsterdam-London, and American Elsevier Publishing Company, Inc., New York, 1971, VIII + 111 pp. [REVIEW]Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.details
- John Case. Enumeration reducibility and partial degrees. Annals of mathematical logic, vol. 2 no. 4 , pp. 419–439.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):605-606.details
- Review: Joseph R. Shoenfield, Degrees of Unsolvability. [REVIEW]Leonard P. Sasso - 1975 - Journal of Symbolic Logic 40 (3):452-453.details
- Review: John Case, Enumeration Reducibility and Partial Degrees. [REVIEW]Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):605-606.details
|
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
|
RSS feed
|
|