|
|
Venues (Conferences, Journals, ...)
|
|
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 |
227 | George Barmpalias |
Hypersimplicity and semicomputability in the weak truth table degrees. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Hypersimple, Semicomputable, Weak Truth Table Degrees |
61 | Ganesh Baliga, John Case |
Learnability: Admissible, Co-finite, and Hypersimple Languages. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
60 | Sergei Podzorov |
Upper Semilattices in Many-One Degrees. |
CiE |
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 |
33 | Ziv Shami |
On uncountable hypersimple unidimensional theories. |
Arch. Math. Log. |
2014 |
DBLP DOI BibTeX RDF |
|
33 | Ziv Shami |
Countable hypersimple unidimensional theories. |
J. Lond. Math. Soc. |
2011 |
DBLP DOI BibTeX RDF |
|
33 | Martin Kummer, Marcus Schäfer 0001 |
Cuppability of Simple and Hypersimple Sets. |
Notre Dame J. Formal Log. |
2007 |
DBLP DOI BibTeX RDF |
|
33 | George Barmpalias, Andrew E. M. Lewis |
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees. |
Notre Dame J. Formal Log. |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Andrej Muchnik, Alexei L. Semenov |
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets. |
Ann. Pure Appl. Log. |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Valentina S. Harizanov |
Turing degrees of hypersimple relations on computable structures. |
Ann. Pure Appl. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Ganesh Baliga, John Case |
Learnability: Admissible, Co-Finite, and Hypersimple Languages. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
33 | Jeffrey B. Remmel |
Co-Hypersimple Structures. |
J. Symb. Log. |
1976 |
DBLP DOI BibTeX RDF |
|
33 | Carl G. Jockusch Jr., Robert I. Soare |
Post's Problem and His Hypersimple Set. |
J. Symb. Log. |
1973 |
DBLP DOI BibTeX RDF |
|
33 | Thomas G. McLaughlin |
Strong reducibility on hypersimple sets. |
Notre Dame J. Formal Log. |
1965 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #13 of 13 (100 per page; Change: )
|
|