Automorphisms of the lattice of recursively enumerable sets / / Peter Cholak.
Saved in:
Superior document: | Memoirs of the American Mathematical Society, Number 541 |
---|---|
VerfasserIn: | |
Place / Publishing House: | Providence, Rhode Island : : American Mathematical Society,, 1995. 1995 |
Year of Publication: | 1995 |
Language: | English |
Series: | Memoirs of the American Mathematical Society ;
Number 541. |
Online Access: | |
Physical Description: | 1 online resource (166 pages). |
Notes: | "January 1995, Volume 113, Number 541 (first of 4 numbers)." |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The role of true finiteness in the admissible recursively enumerable degrees / / Noam Greenberg.
by: Greenberg, Noam,
Published: ([2006]) -
Minimal weak truth table degrees and computably enumerable Turing degrees / / Rodney G. Downey, Keng Meng Ng, Reed Solomon.
by: Downey, R. G.
Published: (2020.) -
The reconstruction of trees from their automorphism groups / / Matatyahu Rubin.
by: Rubin, Matatyahu,
Published: ([1993]) -
A Hierarchy of Turing Degrees : : A Transfinite Hierarchy of Lowness Notions in the Computably Enumerable Degrees, Unifying Classes, and Natural Definability (AMS-206) / / Noam Greenberg, Rod Downey.
by: Downey, Rod,
Published: ([2020]) -
Convergence theorems for lattice group-valued measures / / authored by Antonio Boccuto, Xenofon Dimitriou.
by: Boccuto, Antonio,
Published: (2015.)