Asher M. Kach, Ph.D.
Affiliations: | 2007 | University of Wisconsin, Madison, Madison, WI |
Area:
MathematicsGoogle:
"Asher Kach"Parents
Sign in to add mentor| Steffen Lempp | grad student | 2007 | UW Madison | |
| (Characterizing the computable structures: Boolean algebras and linear orders.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Greenberg N, Kach AM, Lempp S, et al. (2015) Computability and uncountable linear orders II: Degree spectra Journal of Symbolic Logic. 80: 145-178 |
| Greenberg N, Kach AM, Lempp S, et al. (2015) Computability and uncountable linear orders I: Computable categoricity Journal of Symbolic Logic. 80: 116-144 |
| Downey RG, Kach AM, Lempp S, et al. (2015) The complexity of computable categoricity Advances in Mathematics. 268: 423-466 |
| Kach A, Montalbán A. (2014) Undecidability of the theories of classes of structures Journal of Symbolic Logic. 79: 1001-1019 |
| Andrews U, Kach AM. (2014) Computing and Dominating the Ryll-Nardzewski Function Algebra and Logic. 53: 176-183 |
| Downey RG, Kach AM, Lempp S, et al. (2013) Computable categoricity versus relative computable categoricity Fundamenta Mathematicae. 221: 129-159 |
| Kach AM, Lange K, Solomon R. (2013) Degrees of orders on torsion-free Abelian groups Annals of Pure and Applied Logic. 164: 822-836 |
| Franklin JNY, Kach AM, Miller R, et al. (2013) Local computability for ordinals Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7921: 161-170 |
| Andersen BM, Kach AM, Melnikov AG, et al. (2012) Jump degrees of torsion-free abelian groups Journal of Symbolic Logic. 77: 1067-1100 |
| Kach AM, Lempp S. (2012) Downward closure of depth in countable Boolean algebras Algebra Universalis. 68: 57-74 |