Relations Intrinsically Recursive in Linear Orders
β Scribed by Michael Moses
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 357 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
6 re1ut;m on 'u, then (1) impEies ( 2 ) : * ) These results \-ere presented at the Conference on Iiogic imd Computation in 1984, held at :30* JIonash University, llelbo~trnc, Australia.
π SIMILAR VOLUMES
I ) The second author was supported by a VUW Post-Doctoral Fellowship in the Department of Mathematics.
## Abstract Using only propositional connectives and the provability predicate of a Ξ£~1~βsound theory __T__ containing Peano Arithmetic we define recursively enumerable relations that are complete for specific natural classes of relations, as the class of all r. e. relations, and the class of all s