Greenberg, Noam Two applications of admissible computability. (English) Zbl 1505.03091 Rezuş, Adrian (ed.), Contemporary logic and computing. London: College Publications. Landsc. Log. 1, 604-637 (2020). MSC: 03D60 03D65 03D32 03D45 PDFBibTeX XMLCite \textit{N. Greenberg}, Landsc. Log. 1, 604--637 (2020; Zbl 1505.03091)
Greenberg, Noam; Turetsky, Dan; Westrick, Linda Brown Finding bases of uncountable free abelian groups is usually difficult. (English) Zbl 1414.03006 Trans. Am. Math. Soc. 370, No. 6, 4483-4508 (2018). Reviewer: Valery Plisko (Moskva) MSC: 03C57 03D60 03D45 20K99 PDFBibTeX XMLCite \textit{N. Greenberg} et al., Trans. Am. Math. Soc. 370, No. 6, 4483--4508 (2018; Zbl 1414.03006) Full Text: DOI arXiv
Greenberg, Noam; Monin, Benoit Higher randomness and genericity. (English) Zbl 1385.03042 Forum Math. Sigma 5, Paper No. e31, 41 p. (2017). Reviewer: Roman Murawski (Poznań) MSC: 03D32 03D60 03D80 03E40 PDFBibTeX XMLCite \textit{N. Greenberg} and \textit{B. Monin}, Forum Math. Sigma 5, Paper No. e31, 41 p. (2017; Zbl 1385.03042) Full Text: DOI
Bienvenu, Laurent; Greenberg, Noam; Monin, Benoit Continuous higher randomness. (English) Zbl 1420.03100 J. Math. Log. 17, No. 1, Article ID 1750004, 53 p. (2017). MSC: 03D32 03D60 PDFBibTeX XMLCite \textit{L. Bienvenu} et al., J. Math. Log. 17, No. 1, Article ID 1750004, 53 p. (2017; Zbl 1420.03100) Full Text: DOI arXiv
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D. Computability and uncountable linear orders. II: Degree spectra. (English) Zbl 1359.03035 J. Symb. Log. 80, No. 1, 145-178 (2015). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03D60 03C57 03D45 PDFBibTeX XMLCite \textit{N. Greenberg} et al., J. Symb. Log. 80, No. 1, 145--178 (2015; Zbl 1359.03035) Full Text: DOI Link
Greenberg, Noam; Kach, Asher M.; Lempp, Steffen; Turetsky, Daniel D. Computability and uncountable linear orders. I: Computable categoricity. (English) Zbl 1359.03034 J. Symb. Log. 80, No. 1, 116-144 (2015). Reviewer: Andrei S. Morozov (Novosibirsk) MSC: 03D60 03C57 03D45 PDFBibTeX XMLCite \textit{N. Greenberg} et al., J. Symb. Log. 80, No. 1, 116--144 (2015; Zbl 1359.03034) Full Text: DOI Link
Greenberg, Noam; Knight, Julia F. 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 \textit{N. Greenberg} and \textit{J. F. Knight}, Lect. Notes Log. 41, 50--80 (2013; Zbl 1369.03116)
Downey, Rod; Greenberg, Noam 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 \textit{R. Downey} and \textit{N. Greenberg}, Lect. Notes Comput. Sci. 3959, 46--60 (2006; Zbl 1109.03039) Full Text: DOI
Greenberg, Noam; Shore, Richard A.; Slaman, Theodore A. The theory of the metarecursively enumerable degrees. (English) Zbl 1109.03040 J. Math. Log. 6, No. 1, 49-68 (2006). Reviewer: Rodney Downey (Wellington) MSC: 03D60 03D25 PDFBibTeX XMLCite \textit{N. Greenberg} et al., J. Math. Log. 6, No. 1, 49--68 (2006; Zbl 1109.03040) Full Text: DOI
Greenberg, Noam The role of true finiteness in the admissible recursively enumerable degrees. (English) Zbl 1096.03052 Mem. Am. Math. Soc. 854, 99 p. (2006). Reviewer: Leon Harkleroad (Wilton) MSC: 03D60 03D25 03D30 03C62 PDFBibTeX XMLCite \textit{N. Greenberg}, The role of true finiteness in the admissible recursively enumerable degrees. Providence, RI: American Mathematical Society (AMS) (2006; Zbl 1096.03052) Full Text: DOI
Greenberg, Noam The role of true finiteness in the admissible recursively enumerable degrees. (English) Zbl 1098.03051 Bull. Symb. Log. 11, No. 3, 398-410 (2005). Reviewer: Qian Lei (Nashville) MSC: 03D60 03D25 PDFBibTeX XMLCite \textit{N. Greenberg}, Bull. Symb. Log. 11, No. 3, 398--410 (2005; Zbl 1098.03051) Full Text: DOI Link