The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Hypersimple with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1965-2014 (13)
Publication types (Num. hits)
article(11) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
227George Barmpalias Hypersimplicity and semicomputability in the weak truth table degrees. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Hypersimple, Semicomputable, Weak Truth Table Degrees
61Ganesh Baliga, John Case Learnability: Admissible, Co-finite, and Hypersimple Languages. Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
60Sergei Podzorov Upper Semilattices in Many-One Degrees. Search on Bibsonomy CiE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Distributive Upper Semilattice, Many-One Degree, Lachlan Semilattice, Computably Enumerable Set, Simple Set, Hypersimple Set, Immune Set, Hyperimmune Set, Arithmetical Hierarchy
33Ziv Shami On uncountable hypersimple unidimensional theories. Search on Bibsonomy Arch. Math. Log. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
33Ziv Shami Countable hypersimple unidimensional theories. Search on Bibsonomy J. Lond. Math. Soc. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Martin Kummer, Marcus Schäfer 0001 Cuppability of Simple and Hypersimple Sets. Search on Bibsonomy Notre Dame J. Formal Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33George Barmpalias, Andrew E. M. Lewis The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. Search on Bibsonomy Notre Dame J. Formal Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Andrej Muchnik, Alexei L. Semenov Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Valentina S. Harizanov Turing degrees of hypersimple relations on computable structures. Search on Bibsonomy Ann. Pure Appl. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Ganesh Baliga, John Case Learnability: Admissible, Co-Finite, and Hypersimple Languages. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
33Jeffrey B. Remmel Co-Hypersimple Structures. Search on Bibsonomy J. Symb. Log. The full citation details ... 1976 DBLP  DOI  BibTeX  RDF
33Carl G. Jockusch Jr., Robert I. Soare Post's Problem and His Hypersimple Set. Search on Bibsonomy J. Symb. Log. The full citation details ... 1973 DBLP  DOI  BibTeX  RDF
33Thomas G. McLaughlin Strong reducibility on hypersimple sets. Search on Bibsonomy Notre Dame J. Formal Log. The full citation details ... 1965 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license