×

Found 11 Documents (Results 1–11)

Computable structure theory on \(\omega_1\) using admissibility. (English) Zbl 1369.03116

Greenberg, Noam (ed.) et al., Effective mathematics of the uncountable. Cambridge: Cambridge University Press; Ithaca, NY: Association for Symbolic Logic (ASL) (ISBN 978-1-107-01451-0/hbk; 978-1-139-02859-2/ebook). Lecture Notes in Logic 41, 50-80 (2013).
MSC:  03D60 03C57 03D45
PDFBibTeX XMLCite

Totally \(< \omega^{ \omega }\) computably enumerable and \(m\)-topped degrees. (English) Zbl 1109.03039

Cai, Jin-Yi (ed.) et al., Theory and applications of models of computation. Third international conference, TAMC 2006, Beijing, China, May 15–20, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34021-1/pbk). Lecture Notes in Computer Science 3959, 46-60 (2006).
MSC:  03D60 03D25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field