American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(03C57) AND publication=(tran)
Sort order: Date
Format: Standard display

  
Results: 1 to 20 of 20 found      Go to page: 1

[1] Denis R. Hirschfeldt, Ken Kramer, Russell Miller and Alexandra Shlapentokh. Categoricity properties for computable algebraic fields. Trans. Amer. Math. Soc. 367 (2015) 3981-4017.
Abstract, references, and article information   
View Article: PDF

[2] Russell Miller and Alexandra Shlapentokh. Computable categoricity for algebraic fields with splitting algorithms. Trans. Amer. Math. Soc. 367 (2015) 3955-3980.
Abstract, references, and article information   
View Article: PDF

[3] Rodney Downey and Alexander G. Melnikov. Computable completely decomposable groups. Trans. Amer. Math. Soc. 366 (2014) 4243-4266.
Abstract, references, and article information   
View Article: PDF

[4] Uri Andrews and Alice Medvedev. Recursive spectra of strongly minimal theories satisfying the Zilber Trichotomy. Trans. Amer. Math. Soc. 366 (2014) 2393-2417.
Abstract, references, and article information   
View Article: PDF

[5] Dietrich Kuske, Jiamou Liu and Markus Lohrey. The isomorphism problem on classes of automatic structures with transitive relations. Trans. Amer. Math. Soc. 365 (2013) 5103-5151.
Abstract, references, and article information   
View Article: PDF

[6] Charles McCoy and John Wallbaum. Describing free groups, Part II: $\Pi^0_4$ hardness and no $\Sigma_{2}^{0}$ basis. Trans. Amer. Math. Soc. 364 (2012) 5729-5734.
Abstract, references, and article information   
View Article: PDF

[7] J. Carson, V. Harizanov, J. Knight, K. Lange, C. McCoy, A. Morozov, S. Quinn, C. Safranski and J. Wallbaum. Describing free groups. Trans. Amer. Math. Soc. 364 (2012) 5715-5728.
Abstract, references, and article information   
View Article: PDF

[8] Kenneth Harris and Antonio Montalbán. On the $n$-back-and-forth types of Boolean algebras. Trans. Amer. Math. Soc. 364 (2012) 827-866. MR 2846355.
Abstract, references, and article information   
View Article: PDF

[9] Russell Miller. Is it harder to factor a polynomial or to find a root?. Trans. Amer. Math. Soc. 362 (2010) 5261-5281. MR 2657679.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[10] Denis R. Hirschfeldt, Richard A. Shore and Theodore A. Slaman. The atomic model theorem and type omitting. Trans. Amer. Math. Soc. 361 (2009) 5805-5837. MR 2529915.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[11] Noam Greenberg and Antonio Montalbán. Ranked structures and arithmetic transfinite recursion. Trans. Amer. Math. Soc. 360 (2008) 1265-1307. MR 2357696.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[12] Richard A. Shore. Invariants, Boolean algebras and ACA$_{0}^{+}$. Trans. Amer. Math. Soc. 358 (2006) 989-1014. MR 2187642.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[13] André Nies. Effectively dense Boolean algebras and their applications. Trans. Amer. Math. Soc. 352 (2000) 4989-5012. MR 1776883.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[14] Ramez L. Sami. Polish group actions and the Vaught conjecture . Trans. Amer. Math. Soc. 341 (1994) 335-353. MR 1022169.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[15] Rodney G. Downey and Michael F. Moses. Recursive linear orders with incomplete successivities . Trans. Amer. Math. Soc. 326 (1991) 653-668. MR 1005933.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[16] C. J. Ash. Errata to: ``Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees'' [Trans.\ Amer.\ Math.\ Soc.\ {\bf 298} (1986), no.\ 2, 497--514; MR0860377 (87j:03060)] . Trans. Amer. Math. Soc. 310 (1988) 851. MR 949898.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[17] C. J. Ash. Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees . Trans. Amer. Math. Soc. 298 (1986) 497-514. MR 860377.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[18] H. A. Kierstead and J. B. Remmel. Degrees of indiscernibles in decidable models . Trans. Amer. Math. Soc. 289 (1985) 41-57. MR 779051.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[19] Angus Macintyre and David Marker. Degrees of recursively saturated models . Trans. Amer. Math. Soc. 282 (1984) 539-554. MR 732105.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[20] Terrence Millar. Persistently finite theories with hyperarithmetic models . Trans. Amer. Math. Soc. 278 (1983) 91-99. MR 697062.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 20 of 20 found      Go to page: 1


Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia