Antonio Montalbán

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 16

Top Topics

Monotonicity Property

Group Activities

Global Consistency

Top Venues

Ann. Pure Appl. Log.

Publications

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