activity
20082017
most citedThe Veblen functions for computability theorists

28 citations · 54 across the 12 of their papers we have counts for

collaborators

14 papers

math.LO2017★ 8 cited

On the inevitability of the consistency operator

Antonio Montalbán, James Walsh

We examine recursive monotonic functions on the Lindenbaum algebra of . We prove that no such function sends every consistent to a sentence with deductive strength…

math.LO2016★ 12 cited

Borel Functors and Infinitary Interpretations

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

We introduce the notion of infinitary interpretation of structures. In general, an interpretation between structures induces a continuous homomorphism between their automorphism gr…

q-bio.PE2015

A mathematical analysis of the evolutionary benefits of sexual reproduction

Andrew Lewis-Pye, Antonio Montalban

The question as to why most higher organisms reproduce sexually has remained open despite extensive research, and has been called "the queen of problems in evolutionary biology". T…

math.LO2015

Computable functors and effective interpretability

Matthew Harrison-Trainor, Alexander Melnikov, Russell Miller +1

Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theo…

math.LO2014

Independence in computable algebra

Matthew Harrison-Trainor, Alexander Melnikov, Antonio Montalbán

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply…

math.LO2014★ 1 cited

Computable structures in generic extensions

Julia Knight, Antonio Montalban, Noah Schweber

In this paper, we investigate connections between structures present in every generic extension of the universe and computability theory. We introduce the notion of {\em generi…

math.LO2013

Classes of structures with no intermediate isomorphism problems

Antonio Montalbán

We say that a theory is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective…

math.LO2013★ 1 cited

Priority arguments via true strages

Antonio Montalbán

We describe a variation of Ash's -system, and give a new proof of Ash's metatheorem. As an application, we prove a generalization of Ash and Knight's theorem on pairs of structu…

math.LO2012

A computability theoretic equivalent to Vaught's conjecture

Antonio Montalban

We prove that, for every theory which is given by an sentence, has less than many countable models if and only if we have that, for ev…

math.LO2012★ 3 cited

Computing Maximal Chains

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

In 1967 Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that…

math.LO2011

Relative to any non-hyperarithmetic set

Noam Greenberg, Antonio Montalban, Theodore Slaman

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish…

math.LO2011★ 1 cited

A fixed point for the jump operator on structures

Antonio Montalban

Assuming that $0^#$ exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure such that \[ Sp({\mathcal…

math.LO2009★ 28 cited

The Veblen functions for computability theorists

Alberto Marcone, Antonio Montalbán

We study the computability-theoretic complexity and proof-theoretic strength of the following statements: (1) "If X is a well-ordering, then so is epsilon_X", and (2) "If X is a we…

math.LO2008

K-trivials are NCR

Antonio Montalban, Theodore A. Slaman

We show that for every K-trivial real X, there is no representation of a continuous probability measure m such that X is 1-random relative to m.