Antonio Montalbán

46 papers A* 1C 3Journal 41Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
The Tree of Tuples of a Structure.
J. Symb. Log.
Matthew Harrison-Trainor, Antonio Montalbán
2021 J jnl
Punctual definability on structures.
Ann. Pure Appl. Log.
Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán
2020 J jnl
The determined Property of Baire in Reverse Math.
J. Symb. Log.
Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick
2019 J jnl
Jump inversions of algebraic structures and Σ-definability.
Math. Log. Q.
Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko
2019 J jnl
On the Inevitability of the Consistency operator.
J. Symb. Log.
Antonio Montalbán, James Walsh
2018 J jnl
Borel Functors and Infinitary Interpretations.
J. Symb. Log.
Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán
2018 J jnl
Coding and Definability in Computable Structures.
Notre Dame J. Formal Log.
Antonio Montalbán
2018 J jnl
Computable Polish Group Actions.
J. Symb. Log.
Alexander G. Melnikov, Antonio Montalbán
2018 J jnl
Conservativity of Ultrafilters over Subsystems of second order Arithmetic.
J. Symb. Log.
Antonio Montalbán, Richard A. Shore
2017 J jnl
Computable Functors and Effective interpretability.
J. Symb. Log.
Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán
2017 — conf
Effectively Existentially-Atomic Structures.
Computability and Complexity
Antonio Montalbán
2017 J jnl
Fraïssé's conjecture in Π11-comprehension.
J. Math. Log.
Antonio Montalbán
2017 J jnl
The Least ∑-jump Inversion Theorem for
J. Univers. Comput. Sci.
Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko
2016 J jnl
Classes of Structures with no Intermediate Isomorphism Problems.
J. Symb. Log.
Antonio Montalbán
2016 J jnl
Computable Structures in Generic Extensions.
J. Symb. Log.
Julia F. Knight, Antonio Montalbán, Noah David Schweber
2016 J jnl
The complements of Lower cones of Degrees and the degree spectra of Structures.
J. Symb. Log.
Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán
2014 J jnl
Priority Arguments via True stages.
J. Symb. Log.
Antonio Montalbán
2014 J jnl
Undecidability of the Theories of Classes of Structures.
J. Symb. Log.
Asher M. Kach, Antonio Montalbán
2013 J jnl
A fixed point for the jump operator on structures.
J. Symb. Log.
Antonio Montalbán
2013 J jnl
Copyable structures.
J. Symb. Log.
Antonio Montalbán
2013 J jnl
Relative to any non-Hyperarithmetic Set.
J. Math. Log.
Noam Greenberg, Antonio Montalbán, Theodore A. Slaman
2012 J jnl
Computing maximal chains.
Arch. Math. Log.
Alberto Marcone, Antonio Montalbán, Richard A. Shore
2012 J jnl
Counting the back-and-forth types.
J. Log. Comput.
Antonio Montalbán
2012 J jnl
Isomorphism relations on computable structures.
J. Symb. Log.
Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán
2011 J jnl
Computability of Fraïssé limits.
J. Symb. Log.
Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán
2011 J jnl
Cuts of Linear Orders.
Order
Asher M. Kach, Antonio Montalbán
2011 J jnl
Open questions in reverse mathematics.
Bull. Symb. Log.
Antonio Montalbán
2011 J jnl
The Veblen functions for computability theorists.
J. Symb. Log.
Alberto Marcone, Antonio Montalbán
2010 J jnl
A computable Alef
J. Symb. Log.
Bakhadyr Khoussainov, Antonio Montalbán
2009 C conf
Notes on the Jump of a Structure.
CiE
Antonio Montalbán
2009 J jnl
On Fraïssé's conjecture for linear orders of finite Hausdorff rank.
Ann. Pure Appl. Log.
Alberto Marcone, Antonio Montalbán
2008 A* conf
From Automatic Structures to Borel Structures.
LICS
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies
2008 J jnl
On the pi
Math. Log. Q.
Antonio Montalbán
2007 C conf
A Weakly 2-Random Set That Is Not Generalized Low.
CiE
Andrew E. M. Lewis, Antonio Montalbán, André Nies
2007 J jnl
Computable Linearizations of Well-partial-orderings.
Order
Antonio Montalbán
2007 J jnl
On the Equimorphism Types of Linear Orderings.
Bull. Symb. Log.
Antonio Montalbán
2006 C conf
A Cappable Almost Everywhere Dominating Computably Enumerable Degree.
CCA
George Barmpalias, Antonio Montalbán
2006 J jnl
Boolean Algebras, Tarski Invariants, and Index Sets.
Notre Dame J. Formal Log.
Barbara F. Csima, Antonio Montalbán, Richard A. Shore
2006 J jnl
Countably Complementable Linear Orderings.
Order
Antonio Montalbán
2006 J jnl
Equivalence between Fraïssé's conjecture and Jullien's theorem.
Ann. Pure Appl. Log.
Antonio Montalbán
2006 J jnl
Indecomposable linear Orderings and Hyperarithmetic Analysis.
J. Math. Log.
Antonio Montalbán
2006 J jnl
There is no ordering on the classes in the generalized high/low hierarchies.
Arch. Math. Log.
Antonio Montalbán
2005 J jnl
Up to equimorphism, hyperarithmetic is recursive.
J. Symb. Log.
Antonio Montalbán
2004 J jnl
Generalized high degrees have the complementation property.
J. Symb. Log.
Noam Greenberg, Antonio Montalbán, Richard A. Shore
2003 J jnl
Embedding and Coding below a 1-Generic Degree.
Notre Dame J. Formal Log.
Noam Greenberg, Antonio Montalbán
2003 J jnl
Embedding jump upper semilattices into the Turing degrees.
J. Symb. Log.
Antonio Montalbán