Antonio Montalbán

MaRDI QIDQ453199zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The structural complexity of models of arithmetic The Journal of Symbolic Logic	2025-02-03	Paper
The spark of synchronization in heterogeneous networks of chaotic maps Chaos	2024-05-29	Paper
Emergence of chaotic cluster synchronization in heterogeneous networks	2023-09-18	Paper
The structural complexity of models of arithmetic	2022-08-02	Paper
Herd immunity under individual variation and reinfection Journal of Mathematical Biology	2022-07-13	Paper
The tree of tuples of a structure Journal of Symbolic Logic	2022-04-12	Paper
A Feiner Look at the Intermediate Degrees	2021-10-12	Paper
Computable Structure Theory	2021-07-26	Paper
Punctual definability on structures Annals of Pure and Applied Logic	2021-06-14	Paper
Jump inversions of algebraic structures and Σ‐definability Mathematical Logic Quarterly	2020-05-06	Paper
THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH Journal of Symbolic Logic	2020-04-17	Paper
Martin's Conjecture: A Classification of the Naturally Occurring Turing Degrees Notices of the American Mathematical Society	2019-10-28	Paper
On the structure of the Wadge degrees of bqo-valued Borel functions Transactions of the American Mathematical Society	2019-06-05	Paper
BOREL FUNCTORS AND INFINITARY INTERPRETATIONS Journal of Symbolic Logic	2019-01-04	Paper
Jump inversions of algebraic structures and the \({\Sigma}\)-definability Algebra and Logic	2018-11-14	Paper
The uniform Martin's conjecture for many-one degrees Transactions of the American Mathematical Society	2018-10-18	Paper
Coding and definability in computable structures Notre Dame Journal of Formal Logic	2018-09-19	Paper
Coding and definability in computable structures Notre Dame Journal of Formal Logic	2018-09-19	Paper
Conservativity of ultrafilters over subsystems of second order arithmetic Journal of Symbolic Logic	2018-08-10	Paper
Computable Polish group actions Journal of Symbolic Logic	2018-08-10	Paper
Fraïssé's conjecture in \(\Pi_1^1\)-comprehension Journal of Mathematical Logic	2017-12-04	Paper
Computability theoretic classifications for classes of structures	2017-10-25	Paper
scientific article; zbMATH DE number 6769397 (Why is no real title available?)	2017-09-04	Paper
Sex versus asex: an analysis of the role of variance conversion Theoretical Population Biology	2017-08-21	Paper
Computable functors and effective interpretability Journal of Symbolic Logic	2017-06-01	Paper
On the structure of the Wadge degrees of BQO-valued Borel functions (available as arXiv preprint)	2017-05-22	Paper
Computable structures in generic extensions Journal of Symbolic Logic	2017-04-28	Paper
THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES Journal of Symbolic Logic	2017-04-28	Paper
Effectively existentially-atomic structures Computability and Complexity	2017-04-04	Paper
Degree-invariant, analytic equivalence relations without perfectly many classes Proceedings of the American Mathematical Society	2016-11-14	Paper
The uniform Martin's conjecture for many-one degrees (available as arXiv preprint)	2016-08-17	Paper
Borel Functors and Infinitary Interpretations (available as arXiv preprint)	2016-06-23	Paper
Classes of structures with no intermediate isomorphism problems The Journal of Symbolic Logic	2016-05-09	Paper
The strength of Turing determinacy within second order arithmetic Fundamenta Mathematicae	2016-02-24	Paper
scientific article; zbMATH DE number 6536309 (Why is no real title available?)	2016-01-27	Paper
A robuster Scott rank Proceedings of the American Mathematical Society	2015-11-02	Paper
Independence in computable algebra Journal of Algebra	2015-09-25	Paper
Rice sequences of relations Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences	2015-08-21	Paper
Analytic equivalence relations satisfying hyperarithmetic-is-recursive Forum of Mathematics, Sigma	2015-05-18	Paper
UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES Journal of Symbolic Logic	2015-03-06	Paper
PRIORITY ARGUMENTS VIA TRUE STAGES Journal of Symbolic Logic	2015-03-06	Paper
The limits of determinacy in second order arithmetic: consistency and complexity strength Israel Journal of Mathematics	2014-12-11	Paper
The complexity of computable categoricity Advances in Mathematics	2014-11-17	Paper
Boolean algebra approximations Transactions of the American Mathematical Society	2014-09-19	Paper
Copyable structures Journal of Symbolic Logic	2014-04-04	Paper
Copyable structures Journal of Symbolic Logic	2014-04-04	Paper
Relative to any non-hyperarithmetic set Journal of Mathematical Logic	2013-10-17	Paper
Extensions of embeddings below computably enumerable degrees Transactions of the American Mathematical Society	2013-07-08	Paper
A fixed point for the jump operator on structures Journal of Symbolic Logic	2013-06-24	Paper
A fixed point for the jump operator on structures Journal of Symbolic Logic	2013-06-24	Paper
\(K\)-trivials are never continuously random Proceedings of the 11th Asian Logic Conference	2013-06-03	Paper
A Cappable Almost Everywhere Dominating Computably Enumerable Degree Electronic Notes in Theoretical Computer Science	2013-05-10	Paper
A computability theoretic equivalent to Vaught's conjecture Advances in Mathematics	2013-03-11	Paper
Computing maximal chains Archive for Mathematical Logic	2012-09-18	Paper
Counting the back-and-forth types Journal of Logic and Computation	2012-09-05	Paper
Isomorphism relations on computable structures Journal of Symbolic Logic	2012-04-19	Paper
Isomorphism relations on computable structures Journal of Symbolic Logic	2012-04-19	Paper
The limits of determinacy in second-order arithmetic Proceedings of the London Mathematical Society	2012-02-24	Paper
On the n-back-and-forth types of Boolean algebras Transactions of the American Mathematical Society	2012-02-24	Paper
Cuts of linear orders Order	2011-12-13	Paper
Open questions in reverse mathematics The Bulletin of Symbolic Logic	2011-10-11	Paper
The Veblen functions for computability theorists Journal of Symbolic Logic	2011-06-28	Paper
The Slaman-Wehner theorem in higher recursion theory Proceedings of the American Mathematical Society	2011-05-27	Paper
Computability of Fraïssé limits Journal of Symbolic Logic	2011-03-18	Paper
Notes on the Jump of a Structure Mathematical Theory and Computational Practice	2010-07-28	Paper
A computable ℵ<sub>0</sub>-categorical structure whose theory computes true arithmetic Journal of Symbolic Logic	2010-06-24	Paper
Embeddings into the Turing degrees	2010-01-13	Paper
On Fraïssé's conjecture for linear orders of finite Hausdorff rank Annals of Pure and Applied Logic	2009-10-26	Paper
On the Π<sub>1</sub> <sup>1</sup> -separation principle Mathematical Logic Quarterly	2008-12-10	Paper
K-trivials are NCR	2008-12-08	Paper
The isomorphism problem for torsion-free abelian groups is analytic complete Journal of Algebra	2008-11-12	Paper
Slender classes Journal of the London Mathematical Society	2008-08-11	Paper
On the triple jump of the set of atoms of a Boolean algebra Proceedings of the American Mathematical Society	2008-06-27	Paper
Ranked structures and arithmetic transfinite recursion Transactions of the American Mathematical Society	2008-01-21	Paper
A Weakly 2-Random Set That Is Not Generalized Low Lecture Notes in Computer Science	2007-11-13	Paper
Subspaces of computable vector spaces Journal of Algebra	2007-10-17	Paper
Computable linearizations of well-partial-orderings Order	2007-10-12	Paper
On the Equimorphism Types of Linear Orderings The Bulletin of Symbolic Logic	2007-08-08	Paper
Countably complementable linear orderings Order	2007-04-26	Paper
Boolean algebras, Tarski invariants, and index sets Notre Dame Journal of Formal Logic	2006-10-04	Paper
INDECOMPOSABLE LINEAR ORDERINGS AND HYPERARITHMETIC ANALYSIS Journal of Mathematical Logic	2006-09-04	Paper
Equimorphism invariants for scattered linear orderings Fundamenta Mathematicae	2006-07-06	Paper
Equivalence between Fraïssé's conjecture and Jullien's theorem Annals of Pure and Applied Logic	2006-04-28	Paper
There is no ordering on the classes in the generalized high/low hierarchies Archive for Mathematical Logic	2006-03-21	Paper
A minimal pair of 𝐾-degrees Proceedings of the American Mathematical Society	2006-02-17	Paper
Up to equimorphism, hyperarithmetic is recursive Journal of Symbolic Logic	2006-01-16	Paper
scientific article; zbMATH DE number 2226382 (Why is no real title available?)	2005-11-08	Paper
Generalized high degrees have the complementation property Journal of Symbolic Logic	2005-08-29	Paper
Embedding and coding below a 1-generic degree Notre Dame Journal of Formal Logic	2005-07-06	Paper
Embedding jump upper semilattices into the Turing degrees Journal of Symbolic Logic	2005-02-09	Paper

Research outcomes over time

This page was built for person: Antonio Montalbán