Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T18:17:38.669Z Has data issue: false hasContentIssue false

On the T-degrees of partial functions

Published online by Cambridge University Press:  12 March 2014

Paolo Casalegno*
Affiliation:
Dipartimento di F1Losofia, Università di Pisa, 56100 Pisa, Italy

Abstract

Let 〈, ≤ 〉 be the usual structure of the degrees of unsolvability and 〈, ≤ 〉 the structure of the T-degrees of partial functions defined in [7]. We prove that every countable distributive lattice with a least element can be isomorphically embedded as an initial segment of 〈, ≤ 〉: as a corollary, the first order theory of 〈, ≤ 〉 is recursively isomorphic to that of 〈, ≤ 〉. We also show that 〈, ≤ 〉 and 〈, ≤ 〉 are not elementarily equivalent.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1985

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable