Antonio Montalbán

According to our database, Antonio Montalbán authored at least 46 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

The Tree of Tuples of a Structure.

Matthew Harrison-Trainor, Antonio Montalbán

J. Symb. Log., 2022

2021

Punctual definability on structures.

Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán

Ann. Pure Appl. Log., 2021

2020

The determined Property of Baire in Reverse Math.

Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick

J. Symb. Log., 2020

2019

Jump inversions of algebraic structures and Σ-definability.

Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko

Math. Log. Q., 2019

On the Inevitability of the Consistency operator.

Antonio Montalbán, James Walsh

J. Symb. Log., 2019

2018

Coding and Definability in Computable Structures.

Antonio Montalbán

Notre Dame J. Formal Log., 2018

Conservativity of Ultrafilters over Subsystems of second order Arithmetic.

Antonio Montalbán, Richard A. Shore

J. Symb. Log., 2018

Computable Polish Group Actions.

Alexander G. Melnikov, Antonio Montalbán

J. Symb. Log., 2018

Borel Functors and Infinitary Interpretations.

Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán

J. Symb. Log., 2018

2017

The Least ∑-jump Inversion Theorem for <i>n</i>-families.

Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko

J. Univers. Comput. Sci., 2017

Computable Functors and Effective interpretability.

Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán

J. Symb. Log., 2017

Fraïssé's conjecture in Π11-comprehension.

Antonio Montalbán

J. Math. Log., 2017

Effectively Existentially-Atomic Structures.

Antonio Montalbán

Proceedings of the Computability and Complexity, 2017

2016

Classes of Structures with no Intermediate Isomorphism Problems.

Antonio Montalbán

J. Symb. Log., 2016

Computable Structures in Generic Extensions.

Julia F. Knight, Antonio Montalbán, Noah David Schweber

J. Symb. Log., 2016

The complements of Lower cones of Degrees and the degree spectra of Structures.

Uri Andrews, Mingzhong Cai, Iskander Sh. Kalimullin, Steffen Lempp, Joseph S. Miller, Antonio Montalbán

J. Symb. Log., 2016

2014

Priority Arguments via True stages.

Antonio Montalbán

J. Symb. Log., 2014

Undecidability of the Theories of Classes of Structures.

Asher M. Kach, Antonio Montalbán

J. Symb. Log., 2014

2013

Copyable structures.

Antonio Montalbán

J. Symb. Log., 2013

A fixed point for the jump operator on structures.

Antonio Montalbán

J. Symb. Log., 2013

Relative to any non-Hyperarithmetic Set.

Noam Greenberg, Antonio Montalbán, Theodore A. Slaman

J. Math. Log., 2013

2012

Counting the back-and-forth types.

Antonio Montalbán

J. Log. Comput., 2012

Isomorphism relations on computable structures.

Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán

J. Symb. Log., 2012

Computing maximal chains.

Alberto Marcone, Antonio Montalbán, Richard A. Shore

Arch. Math. Log., 2012

2011

Cuts of Linear Orders.

Asher M. Kach, Antonio Montalbán

Order, 2011

The Veblen functions for computability theorists.

Alberto Marcone, Antonio Montalbán

J. Symb. Log., 2011

Computability of Fraïssé limits.

Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán

J. Symb. Log., 2011

Open questions in reverse mathematics.

Antonio Montalbán

Bull. Symb. Log., 2011

2010

A computable Alef₀-categorical structure whose theory computes true arithmetic.

Bakhadyr Khoussainov, Antonio Montalbán

J. Symb. Log., 2010

2009

On Fraïssé's conjecture for linear orders of finite Hausdorff rank.

Alberto Marcone, Antonio Montalbán

Ann. Pure Appl. Log., 2009

Notes on the Jump of a Structure.

Antonio Montalbán

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

On the pi₁¹-separation principle.

Antonio Montalbán

Math. Log. Q., 2008

From Automatic Structures to Borel Structures.

Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007

Computable Linearizations of Well-partial-orderings.

Antonio Montalbán

Order, 2007

On the Equimorphism Types of Linear Orderings.

Antonio Montalbán

Bull. Symb. Log., 2007

A Weakly 2-Random Set That Is Not Generalized Low.

Andrew E. M. Lewis, Antonio Montalbán, André Nies

Proceedings of the Computation and Logic in the Real World, 2007

2006

Countably Complementable Linear Orderings.

Antonio Montalbán

Order, 2006

Boolean Algebras, Tarski Invariants, and Index Sets.

Barbara F. Csima, Antonio Montalbán, Richard A. Shore

Notre Dame J. Formal Log., 2006

Indecomposable linear Orderings and Hyperarithmetic Analysis.

Antonio Montalbán

J. Math. Log., 2006

A Cappable Almost Everywhere Dominating Computably Enumerable Degree.

George Barmpalias, Antonio Montalbán

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Equivalence between Fraïssé's conjecture and Jullien's theorem.

Antonio Montalbán

Ann. Pure Appl. Log., 2006

There is no ordering on the classes in the generalized high/low hierarchies.

Antonio Montalbán

Arch. Math. Log., 2006

2005

Up to equimorphism, hyperarithmetic is recursive.

Antonio Montalbán

J. Symb. Log., 2005

2004

Generalized high degrees have the complementation property.

Noam Greenberg, Antonio Montalbán, Richard A. Shore

J. Symb. Log., 2004

2003

Embedding and Coding below a 1-Generic Degree.

Noam Greenberg, Antonio Montalbán

Notre Dame J. Formal Log., 2003

Embedding jump upper semilattices into the Turing degrees.

Antonio Montalbán

J. Symb. Log., 2003