Article contents
The undecidability of the Π4-theory for the r.e. wtt and Turing degrees
Published online by Cambridge University Press: 12 March 2014
Abstract
We show that the Π4-theory of the partial order of recursively enumerable weak truth-table degrees is undecidable, and give a new proof of the similar fact for r.e. T-degrees. This is accomplished by introducing a new coding scheme which consists in defining the class of finite bipartite graphs with parameters.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1995
References
REFERENCES
- 7
- Cited by