default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Montalbán
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j41]Matthew Harrison-Trainor, Antonio Montalbán:
The Tree of Tuples of a Structure. J. Symb. Log. 87(1): 21-46 (2022)- 2021
- [j40]Iskander Sh. Kalimullin
, Alexander G. Melnikov, Antonio Montalbán:
Punctual definability on structures. Ann. Pure Appl. Log. 172(8): 102987 (2021) - 2020
- [j39]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): 166-198 (2020)
2010 – 2019
- 2019
- [j38]Antonio Montalbán, James Walsh:
On the Inevitability of the Consistency operator. J. Symb. Log. 84(1): 205-225 (2019) - [j37]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): 37-45 (2019) - 2018
- [j36]Alexander G. Melnikov, Antonio Montalbán:
Computable Polish Group Actions. J. Symb. Log. 83(2): 443-460 (2018) - [j35]Antonio Montalbán, Richard A. Shore:
Conservativity of Ultrafilters over Subsystems of second order Arithmetic. J. Symb. Log. 83(2): 740-765 (2018) - [j34]Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán:
Borel Functors and Infinitary Interpretations. J. Symb. Log. 83(4): 1434-1456 (2018) - [j33]Antonio Montalbán:
Coding and Definability in Computable Structures. Notre Dame J. Formal Log. 59(3): 285-306 (2018) - 2017
- [j32]Antonio Montalbán:
Fraïssé's conjecture in Π11-comprehension. J. Math. Log. 17(2): 1750006:1-1750006:12 (2017) - [j31]Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán:
Computable Functors and Effective interpretability. J. Symb. Log. 82(1): 77-97 (2017) - [j30]Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko:
The Least ∑-jump Inversion Theorem for n-families. J. Univers. Comput. Sci. 23(6): 529-538 (2017) - [c5]Antonio Montalbán:
Effectively Existentially-Atomic Structures. Computability and Complexity 2017: 221-237 - 2016
- [j29]Antonio Montalbán:
Classes of Structures with no Intermediate Isomorphism Problems. J. Symb. Log. 81(1): 127-150 (2016) - [j28]Julia F. Knight, Antonio Montalbán, Noah David Schweber:
Computable Structures in Generic Extensions. J. Symb. Log. 81(3): 814-832 (2016) - [j27]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): 997-1006 (2016) - 2014
- [j26]Asher M. Kach, Antonio Montalbán:
Undecidability of the Theories of Classes of Structures. J. Symb. Log. 79(4): 1001-1019 (2014) - [j25]Antonio Montalbán:
Priority Arguments via True stages. J. Symb. Log. 79(4): 1315-1335 (2014) - 2013
- [j24]Noam Greenberg, Antonio Montalbán, Theodore A. Slaman:
Relative to any non-Hyperarithmetic Set. J. Math. Log. 13(1): 1250007 (2013) - [j23]Antonio Montalbán:
A fixed point for the jump operator on structures. J. Symb. Log. 78(2): 425-438 (2013) - [j22]Antonio Montalbán:
Copyable structures. J. Symb. Log. 78(4): 1199-1217 (2013) - 2012
- [j21]Alberto Marcone, Antonio Montalbán, Richard A. Shore:
Computing maximal chains. Arch. Math. Log. 51(5-6): 651-660 (2012) - [j20]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): 122-132 (2012) - [j19]Antonio Montalbán:
Counting the back-and-forth types. J. Log. Comput. 22(4): 857-876 (2012) - 2011
- [j18]Antonio Montalbán:
Open questions in reverse mathematics. Bull. Symb. Log. 17(3): 431-454 (2011) - [j17]Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán:
Computability of Fraïssé limits. J. Symb. Log. 76(1): 66-93 (2011) - [j16]Alberto Marcone, Antonio Montalbán:
The Veblen functions for computability theorists. J. Symb. Log. 76(2): 575-602 (2011) - [j15]Asher M. Kach, Antonio Montalbán:
Cuts of Linear Orders. Order 28(3): 593-600 (2011) - 2010
- [j14]Bakhadyr Khoussainov, Antonio Montalbán:
A computable Alef0-categorical structure whose theory computes true arithmetic. J. Symb. Log. 75(2): 728-740 (2010)
2000 – 2009
- 2009
- [j13]Alberto Marcone, Antonio Montalbán:
On Fraïssé's conjecture for linear orders of finite Hausdorff rank. Ann. Pure Appl. Log. 160(3): 355-367 (2009) - [c4]Antonio Montalbán:
Notes on the Jump of a Structure. CiE 2009: 372-378 - 2008
- [j12]Antonio Montalbán:
On the pi11-separation principle. Math. Log. Q. 54(6): 563-578 (2008) - [c3]Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies:
From Automatic Structures to Borel Structures. LICS 2008: 431-441 - 2007
- [j11]Antonio Montalbán:
On the Equimorphism Types of Linear Orderings. Bull. Symb. Log. 13(1): 71-99 (2007) - [j10]Antonio Montalbán:
Computable Linearizations of Well-partial-orderings. Order 24(1): 39-48 (2007) - [c2]Andrew E. M. Lewis, Antonio Montalbán, André Nies:
A Weakly 2-Random Set That Is Not Generalized Low. CiE 2007: 474-477 - 2006
- [j9]Antonio Montalbán:
There is no ordering on the classes in the generalized high/low hierarchies. Arch. Math. Log. 45(2): 215-231 (2006) - [j8]Antonio Montalbán:
Equivalence between Fraïssé's conjecture and Jullien's theorem. Ann. Pure Appl. Log. 139(1-3): 1-42 (2006) - [j7]Antonio Montalbán:
Indecomposable linear Orderings and Hyperarithmetic Analysis. J. Math. Log. 6(1) (2006) - [j6]Barbara F. Csima, Antonio Montalbán, Richard A. Shore:
Boolean Algebras, Tarski Invariants, and Index Sets. Notre Dame J. Formal Log. 47(1): 1-23 (2006) - [j5]Antonio Montalbán:
Countably Complementable Linear Orderings. Order 23(4): 321-331 (2006) - [c1]George Barmpalias, Antonio Montalbán:
A Cappable Almost Everywhere Dominating Computably Enumerable Degree. CCA 2006: 17-31 - 2005
- [j4]Antonio Montalbán:
Up to equimorphism, hyperarithmetic is recursive. J. Symb. Log. 70(2): 360-378 (2005) - 2004
- [j3]Noam Greenberg, Antonio Montalbán, Richard A. Shore:
Generalized high degrees have the complementation property. J. Symb. Log. 69(4): 1200-1220 (2004) - 2003
- [j2]Antonio Montalbán:
Embedding jump upper semilattices into the Turing degrees. J. Symb. Log. 68(3): 989-1014 (2003) - [j1]Noam Greenberg, Antonio Montalbán:
Embedding and Coding below a 1-Generic Degree. Notre Dame J. Formal Log. 44(4): 200-216 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
