American Mathematical Society

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

  
Results: 1 to 30 of 36 found      Go to page: 1 2

[1] 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

[2] Matthew Wright. Turing computable embeddings of equivalences other than isomorphism. Proc. Amer. Math. Soc. 142 (2014) 1795-1811.
Abstract, references, and article information
View Article: PDF

[3] 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

[4] Iskander Kalimullin, Bakhadyr Khoussainov and Alexander Melnikov. Limitwise monotonic sequences and degree spectra of structures. Proc. Amer. Math. Soc. 141 (2013) 3275-3289.
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] Noam Greenberg, Antonio Montalbán and Theodore A. Slaman. The Slaman-Wehner theorem in higher recursion theory. Proc. Amer. Math. Soc. 139 (2011) 1865-1869. MR 2763773.
Abstract, references, and article information
View Article: PDF

[10] 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

[11] 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

[12] 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

[13] Bakhadyr M. Khoussainov, Michael C. Laskowski, Steffen Lempp and Reed Solomon. On the computability-theoretic complexity of trivial, strongly minimal models. Proc. Amer. Math. Soc. 135 (2007) 3711-3721. MR 2336588.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[14] M. A. Dabkowska, M. K. Dabkowski, V. S. Harizanov and A. S. Sikora. Turing degrees of nonabelian groups. Proc. Amer. Math. Soc. 135 (2007) 3383-3391. MR 2322771.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[15] Denis R. Hirschfeldt. Computable trees, prime models, and relative decidability. Proc. Amer. Math. Soc. 134 (2006) 1495-1498. MR 2199197.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[16] 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

[17] Sergey S. Goncharov, Valentina S. Harizanov, Michael C. Laskowski, Steffen Lempp and Charles F. D. McCoy. Trivial, strongly minimal theories are model complete after naming constants. Proc. Amer. Math. Soc. 131 (2003) 3901-3912. MR 1999939.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[18] Denis R. Hirschfeldt. Prime models of theories of computable linear orderings. Proc. Amer. Math. Soc. 129 (2001) 3079-3083. MR 1840114.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[19] 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

[20] Bernhard Herwig, Steffen Lempp and Martin Ziegler. Constructive models of uncountably categorical theories. Proc. Amer. Math. Soc. 127 (1999) 3711-3719. MR 1610909.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[21] Theodore A. Slaman. Relative to any nonrecursive set. Proc. Amer. Math. Soc. 126 (1998) 2117-2122. MR 1443408.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[22] John J. Thurber. Every ${\rm low}\sb 2$ Boolean algebra has a recursive copy . Proc. Amer. Math. Soc. 123 (1995) 3859-3866. MR 1283564.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[23] Rod Downey and Carl G. Jockusch. Every low Boolean algebra is isomorphic to a recursive one . Proc. Amer. Math. Soc. 122 (1994) 871-880. MR 1203984.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[24] 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

[25] Christian Michaux. Corrigendum to: ``Ordered rings over which output sets are recursively enumerable sets'' [Proc.\ Amer.\ Math.\ Soc.\ {\bf 112} (1991), no.\ 2, 569--575; MR1041016 (91i:03073)] . Proc. Amer. Math. Soc. 117 (1993) MR 1140671.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[26] Rodney Downey and Julia F. Knight. Orderings with $\alpha$th jump degree ${\bf 0}\sp {(\alpha)}$ . Proc. Amer. Math. Soc. 114 (1992) 545-552. MR 1065942.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[27] Christian Michaux. Ordered rings over which output sets are recursively enumerable sets . Proc. Amer. Math. Soc. 112 (1991) 569-575. MR 1041016.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[28] 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

[29] Terrence Millar. Tame theories with hyperarithmetic homogeneous models . Proc. Amer. Math. Soc. 105 (1989) 712-726. MR 937851.
Abstract, references, and article information
View Article: PDF
This article is available free of charge

[30] 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


Results: 1 to 30 of 36 found      Go to page: 1 2