Works by Antonio Montalbán ( view other items matching `Antonio Montalbán`, view all matches )

9 found
Sort by:
  1. Noam Greenberg, Antonio Montalbán & Theodore A. Slaman (forthcoming). Relative to Any Non-Hyperarithmetic Set. Journal of Mathematical Logic:1250007-.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  2. Ekaterina B. Fokina, Sy-David Friedman, Valentina Harizanov, Julia F. Knight, Charles McCoy & Antonio Montalbán (2012). Isomorphism Relations on Computable Structures. Journal of Symbolic Logic 77 (1):122-132.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. Antonio Montalbán (2011). Open Questions in Reverse Mathematics. Bulletin of Symbolic Logic 17 (3):431-454.
    We present a list of open questions in reverse mathematics, including some relevant background information for each question. We also mention some of the areas of reverse mathematics that are starting to be developed and where interesting open question may be found.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. Bakhadyr Khoussainov & Antonio Montalbán (2010). A Computable ℵ 0 -Categorical Structure Whose Theory Computes True Arithmetic. Journal of Symbolic Logic 75 (2):728-740.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Antonio Montalbán (2007). On the Equimorphism Types of Linear Orderings. Bulletin of Symbolic Logic 13 (1):71-99.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Barbara F. Csima, Antonio Montalbán & Richard A. Shore (2006). Boolean Algebras, Tarski Invariants, and Index Sets. Notre Dame Journal of Formal Logic 47 (1):1-23.
  7. Antonio Montalbán (2006). Indecomposable Linear Orderings and Hyperarithmetic Analysis. Journal of Mathematical Logic 6 (01):89-120.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  8. Antonio Montalbán (2005). Up to Equimorphism, Hyperarithmetic Is Recursive. Journal of Symbolic Logic 70 (2):360 - 378.
    Two linear orderings are equimorphic if each can be embedded into the other. We prove that every hyperarithmetic linear ordering is equimorphic to a recursive one. On the way to our main result we prove that a linear ordering has Hausdorff rank less than $\omega _{1}^{\mathit{CK}}$ if and only if it is equimorphic to a recursive one. As a corollary of our proof we prove that, given a recursive ordinal α, the partial ordering of equimorphism types of linear orderings of (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  9. Antonio Montalbán (2003). Embedding Jump Upper Semilattices Into the Turing Degrees. Journal of Symbolic Logic 68 (3):989-1014.
    We prove that every countable jump upper semilattice can be embedded in D, where a jump upper semilattice (jusl) is an upper semilattice endowed with a strictly increasing and monotone unary operator that we call jump, and D is the jusl of Turing degrees. As a corollary we get that the existential theory of $\langle D, \leq_{T}, \vee, '\rangle$ is decidable. We also prove that this result is not true about jusls with 0, by proving that not every quantifier free (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation