Cargando…
Role of true finiteness in the admissible recursively enumerable degrees
Autor principal: | Greenberg, Noam |
---|---|
Lenguaje: | eng |
Publicado: |
American Mathematical Society
2006
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2682378 |
Ejemplares similares
-
Automorphisms of the lattice of recursively enumerable sets
por: Cholak, Peter
Publicado: (1995) -
Computability, enumerability, unsolvability: directions in recursion theory
por: Cooper, S Barry, et al.
Publicado: (1996) -
Enumerability · decidability computability: an introduction to the theory of recursive functions
por: Hermes, Hans
Publicado: (1969) -
Enumerability · decidability computability: an introduction to the theory of recursive functions
por: Hermes, Hans
Publicado: (1965) -
Algebraic computability and enumeration models: recursion theory and descriptive complexity
por: Nourani, Cyrus F
Publicado: (2016)