Review: Kempachiro Ohashi, On Undecidable Theorems [Book Review]

Journal of Symbolic Logic 34 (1):131-131 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,592

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On a question of G. E. Sacks.Kempachiro Ohashi - 1970 - Journal of Symbolic Logic 35 (1):46-50.
A stronger form of a theorem of Friedberg.Kempachiro Ohashi - 1964 - Notre Dame Journal of Formal Logic 5 (1):10-12.
Enumeration of some classes of recursively enumerable sets.Kempachiro Ohashi - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (1):1-6.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.
Some results on measure independent gödel speed-ups.Martin K. Solomon - 1978 - Journal of Symbolic Logic 43 (4):667-672.
The Π₃-Theory of the [image] -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.

Analytics

Added to PP
2013-11-22

Downloads
15 (#940,347)

6 months
4 (#779,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references