Cargando…
Automorphisms of the lattice of recursively enumerable sets
Autor principal: | Cholak, Peter |
---|---|
Lenguaje: | eng |
Publicado: |
American Mathematical Society
1995
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2204199 |
Ejemplares similares
-
Computability, enumerability, unsolvability: directions in recursion theory
por: Cooper, S Barry, et al.
Publicado: (1996) -
Role of true finiteness in the admissible recursively enumerable degrees
por: Greenberg, Noam
Publicado: (2006) -
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) -
Automorphic forms and even unimodular lattices: Kneser neighbors of Niemeier lattices
por: Chenevier, Gaëtan, et al.
Publicado: (2019)