The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Antonio Montalbán" ( http://dblp.L3S.de/Authors/Antonio_Montalbán )

  Author page on DBLP  Author page in RDF  Community of Antonio Montalbán in ASPL-2

Publication years (Num. hits)
2003-2009 (16) 2010-2012 (5)
Publication types (Num. hits)
article(18) inproceedings(3)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 21 publication records. Showing 21 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ekaterina B. Fokina, Sy-David Friedman, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Antonio Montalbán Isomorphism relations on computable structures. Search on Bibsonomy J. Symb. Log. The full citation details ... 2012 DBLP  BibTeX  RDF
1Alberto Marcone, Antonio Montalbán The Veblen functions for computability theorists. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  BibTeX  RDF
1Barbara F. Csima, Valentina S. Harizanov, Russell Miller, Antonio Montalbán Computability of Fraïssé limits. Search on Bibsonomy J. Symb. Log. The full citation details ... 2011 DBLP  BibTeX  RDF
1Asher M. Kach, Antonio Montalbán Cuts of Linear Orders. Search on Bibsonomy Order The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Bakhadyr Khoussainov, Antonio Montalbán A computable Alef0-categorical structure whose theory computes true arithmetic. Search on Bibsonomy J. Symb. Log. The full citation details ... 2010 DBLP  BibTeX  RDF
1Alberto Marcone, Antonio Montalbán On Fraïssé's conjecture for linear orders of finite Hausdorff rank. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Antonio Montalbán Notes on the Jump of a Structure. Search on Bibsonomy CiE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Antonio Montalbán On the pi11-separation principle. Search on Bibsonomy Math. Log. Q. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies From Automatic Structures to Borel Structures. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Borel, Buechi, automata, isomorphism
1Antonio Montalbán On the Equimorphism Types of Linear Orderings. Search on Bibsonomy Bulletin of Symbolic Logic The full citation details ... 2007 DBLP  BibTeX  RDF
1George Barmpalias, Antonio Montalbán A Cappable Almost Everywhere Dominating Computably Enumerable Degree. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Antonio Montalbán Computable Linearizations of Well-partial-orderings. Search on Bibsonomy Order The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Maximal order type, Well-partial-ordering
1Andrew E. M. Lewis, Antonio Montalbán, André Nies A Weakly 2-Random Set That Is Not Generalized Low. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Barbara F. Csima, Antonio Montalbán, Richard A. Shore Boolean Algebras, Tarski Invariants, and Index Sets. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2006 DBLP  BibTeX  RDF
1Antonio Montalbán Equivalence between Fraïssé's conjecture and Jullien's theorem. Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonio Montalbán Countably Complementable Linear Orderings. Search on Bibsonomy Order The full citation details ... 2006 DBLP  DOI  BibTeX  RDF countable linear ordering, extension property, embeddability
1Antonio Montalbán There is no ordering on the classes in the generalized high/low hierarchies. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antonio Montalbán Up to equimorphism, hyperarithmetic is recursive. Search on Bibsonomy J. Symb. Log. The full citation details ... 2005 DBLP  BibTeX  RDF
1Noam Greenberg, Antonio Montalbán, Richard A. Shore Generalized high degrees have the complementation property. Search on Bibsonomy J. Symb. Log. The full citation details ... 2004 DBLP  BibTeX  RDF
1Noam Greenberg, Antonio Montalbán Embedding and Coding below a 1-Generic Degree. Search on Bibsonomy Notre Dame Journal of Formal Logic The full citation details ... 2003 DBLP  BibTeX  RDF
1Antonio Montalbán Embedding jump upper semilattices into the Turing degrees. Search on Bibsonomy J. Symb. Log. The full citation details ... 2003 DBLP  BibTeX  RDF
Displaying result #1 - #21 of 21 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.