Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard A. Shore
Person information
- affiliation: Cornell University, Department of Mathematics, Ithaca, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1997
[b2]Anil Nerode, Richard A. Shore:
Logic for Applications, Second Edition. Graduate Texts in Computer Science, Springer 1997, ISBN 978-0-387-94893-5, pp. I-XIII, 1-456- 1993
- [b1]Anil Nerode, Richard A. Shore:
Logic for Applications. Texts and Monographs in Computer Science, Springer 1993, ISBN 978-0-387-94129-5, pp. I-XVII, 1-365
Journal Articles
- 2023
- [j71]Richard A. Shore
:
Almost theorems of Hyperarithmetic Analysis. J. Symb. Log. 88(2): 664-696 (2023) - 2022
- [j70]James S. Barnes, Jun Le Goh, Richard A. Shore:
Theorems of Hyperarithmetic Analysis and Almost theorems of Hyperarithmetic Analysis. Bull. Symb. Log. 28(1): 133-149 (2022) - 2018
- [j69]Antonio Montalbán, Richard A. Shore:
Conservativity of Ultrafilters over Subsystems of second order Arithmetic. J. Symb. Log. 83(2): 740-765 (2018) - [j68]David R. Bélanger, Richard A. Shore:
On the Jumps of the Degrees Below a Recursively Enumerable Degree. Notre Dame J. Formal Log. 59(1): 91-107 (2018) - 2016
- [j67]Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen, Richard A. Shore:
The strength of the Grätzer-Schmidt theorem. Arch. Math. Log. 55(5-6): 687-704 (2016) - [j66]Stephen Binns, Richard A. Shore, Stephen G. Simpson:
Mass problems and density. J. Math. Log. 16(2): 1650006:1-1650006:10 (2016) - 2014
- [j65]Chris J. Conidis, Richard A. Shore:
The complexity of ascendant sequences in locally nilpotent groups. Int. J. Algebra Comput. 24(2): 189-206 (2014) - [j64]Richard A. Shore:
The Turing Degrees below generics and randoms. J. Symb. Log. 79(1): 171-178 (2014) - 2013
- [j63]Mingzhong Cai, Richard A. Shore:
Low level nondefinability results: Domination and recursive enumeration. J. Symb. Log. 78(3): 1005-1024 (2013) - [j62]Barbara F. Csima, Johanna N. Y. Franklin, Richard A. Shore:
Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame J. Formal Log. 54(2): 215-231 (2013) - 2012
- [j61]Alberto Marcone, Antonio Montalbán, Richard A. Shore:
Computing maximal chains. Arch. Math. Log. 51(5-6): 651-660 (2012) - [j60]Peter Cholak, Damir D. Dzhafarov, Noah David Schweber, Richard A. Shore:
Computably Enumerable Partial Orders. Comput. 1(2): 99-107 (2012) - [j59]Mingzhong Cai, Richard A. Shore, Theodore A. Slaman:
The n-R.E. Degrees: Undecidability and σ1 Substructures. J. Math. Log. 12(1): 1250005 (2012) - [j58]Mingzhong Cai, Richard A. Shore:
Domination, forcing, array nonrecursiveness and relative recursive enumerability. J. Symb. Log. 77(1): 33-48 (2012) - 2011
- [j57]Andrew E. M. Lewis, Richard A. Shore, Andrea Sorbi:
Topological aspects of the Medvedev lattice. Arch. Math. Log. 50(3-4): 319-340 (2011) - [j56]Alberto Marcone, Richard A. Shore:
The maximal linear extension theorem in second order arithmetic. Arch. Math. Log. 50(5-6): 543-564 (2011) - 2010
- [j55]Richard A. Shore:
Reverse mathematics: the playground of logic. Bull. Symb. Log. 16(3): 378-402 (2010) - [j54]Bjørn Kjos-Hanssen, Richard A. Shore:
Lattice initial segments of the hyperdegrees. J. Symb. Log. 75(1): 103-130 (2010) - 2007
- [j53]Richard A. Shore:
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond. Bull. Symb. Log. 13(2): 226-239 (2007) - [j52]Richard A. Shore:
Direct and Local Definitions of the Turing jump. J. Math. Log. 7(2) (2007) - [j51]Denis R. Hirschfeldt, Richard A. Shore:
Combinatorial principles weaker than Ramsey's Theorem for pairs. J. Symb. Log. 72(1): 171-206 (2007) - [j50]Barbara F. Csima, Richard A. Shore:
The settling-time reducibility ordering. J. Symb. Log. 72(3): 1055-1071 (2007) - 2006
- [j49]Peter Cholak, Richard A. Shore, Reed Solomon:
A computably stable structure with no Scott family of finitary formulas. Arch. Math. Log. 45(5): 519-538 (2006) - [j48]Richard A. Shore:
Degree Structures: Local and Global Investigations. Bull. Symb. Log. 12(3): 369-389 (2006) - [j47]Noam Greenberg, Richard A. Shore, Theodore A. Slaman:
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6(1) (2006) - [j46]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) - 2004
- [j45]Joseph Y. Halpern, Richard A. Shore:
Reasoning about common knowledge with infinitely many agents. Inf. Comput. 191(1): 1-40 (2004) - [j44]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Richard A. Shore:
Pi11 relations and paths through. J. Symb. Log. 69(2): 585-611 (2004) - [j43]Noam Greenberg, Antonio Montalbán, Richard A. Shore:
Generalized high degrees have the complementation property. J. Symb. Log. 69(4): 1200-1220 (2004) - 2003
- [j42]Rodney G. Downey, Geoffrey LaForte, Richard A. Shore:
Decomposition and infima in the computably enumerable degrees. J. Symb. Log. 68(2): 551-579 (2003) - [j41]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore:
A computably categorical structure whose expansion by a constant has infinite computable dimension. J. Symb. Log. 68(4): 1199-1241 (2003) - 2002
- [j40]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko:
Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Log. 115(1-3): 71-113 (2002) - [j39]Richard A. Shore, Yue Yang:
A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree. Math. Log. Q. 48(1): 131-146 (2002) - 2001
- [j38]Peter A. Fejer, Richard A. Shore:
Every incomplete computably enumerable truth-table degree is branching. Arch. Math. Log. 40(2): 113-123 (2001) - [j37]Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore:
The prospects for mathematical logic in the twenty-first century. Bull. Symb. Log. 7(2): 169-196 (2001) - 2000
- [j36]Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore:
Undecidability and 1-types in intervals of the computably enumerable degrees. Ann. Pure Appl. Log. 106(1-3): 1-47 (2000) - 1999
- [j35]Bakhadyr Khoussainov, Richard A. Shore:
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". Ann. Pure Appl. Log. 98(1-3): 297-298 (1999) - [j34]Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore:
Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64(1): 13-37 (1999) - 1998
- [j33]Bakhadyr Khoussainov, Richard A. Shore:
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. Ann. Pure Appl. Log. 93(1-3): 153-193 (1998) - [j32]Rodney G. Downey, Richard A. Shore:
Splitting Theorems and the Jump Operator. Ann. Pure Appl. Log. 94(1-3): 45-52 (1998) - 1997
- [j31]Richard A. Shore:
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability. Arch. Math. Log. 36(4-5): 233-253 (1997) - [j30]Richard A. Shore:
Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface. Ann. Pure Appl. Log. 87(2): 101-102 (1997) - [j29]Richard A. Shore:
Alonzo Church. Bull. Symb. Log. 3(2): 153- (1997) - [j28]Bakhadyr Khoussainov, André Nies, Richard A. Shore:
Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38(2): 165-178 (1997) - 1996
- [j27]Marat M. Arslanov, Steffen Lempp, Richard A. Shore:
Interpolating d-r.e. and REA Degrees between r.e. Degrees. Ann. Pure Appl. Log. 78(1-3): 29-56 (1996) - [j26]André Nies, Richard A. Shore, Theodore A. Slaman:
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2(4): 392-404 (1996) - 1995
- [j25]André Nies, Richard A. Shore:
Interpreting True Arithmetic in the Theory of the r.e. Truth Table Degrees. Ann. Pure Appl. Log. 75(3): 269-311 (1995) - [j24]Richard A. Shore:
The Bulletin of Symbolic Logic. Bull. Symb. Log. 1(1): 1-3 (1995) - [j23]Rodney G. Downey, Richard A. Shore:
Degree Theoretic Definitions of the low2 Recursively Enumerable Sets. J. Symb. Log. 60(3): 727-756 (1995) - 1993
- [j22]Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore:
Countable Thin Pi01 Classes. Ann. Pure Appl. Log. 59(2): 79-139 (1993) - [j21]Klaus Ambos-Spies, Richard A. Shore:
Undecidability and 1-Types in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 63(1): 3-37 (1993) - [j20]Richard A. Shore, Theodore A. Slaman:
Working below a Highly Recursively Enumerable Degree. J. Symb. Log. 58(3): 824-859 (1993) - [j19]Steffen Lempp, Rodney G. Downey, Richard A. Shore:
Highness and Bounding Minimal Pairs. Math. Log. Q. 39: 475-491 (1993) - 1992
- [j18]Alistair H. Lachlan, Richard A. Shore:
Then-rea enumeration degrees are dense. Arch. Math. Log. 31(4): 277-285 (1992) - [j17]Ron Aharoni, Menachem Magidor, Richard A. Shore:
On the strength of König's duality theorem for infinite bipartite graphs. J. Comb. Theory B 54(2): 257-290 (1992) - [j16]Klaus Ambos-Spies, André Nies, Richard A. Shore:
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. J. Symb. Log. 57(3): 864-874 (1992) - [j15]Richard A. Shore, Theodore A. Slaman:
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. Theor. Comput. Sci. 97(2): 263-284 (1992) - 1990
- [j14]Richard A. Shore, Theodore A. Slaman:
Working below a low2 recursively enumerably degree. Arch. Math. Log. 29(3): 201-211 (1990) - [j13]Christine Ann Haught, Richard A. Shore:
Undecidability and Initial Segments of the R.E. tt-Degrees. J. Symb. Log. 55(3): 987-1006 (1990) - 1988
- [j12]Richard A. Shore:
A non-inversion theorem for the jump operator. Ann. Pure Appl. Log. 40(3): 277-303 (1988) - [j11]Peter A. Fejer, Richard A. Shore:
Infima of recursively enumerable truth table degrees. Notre Dame J. Formal Log. 29(3): 420-437 (1988) - 1984
- [j10]Richard A. Shore:
The arithmetic and Turing degrees are not elementarily equivalent. Arch. Math. Log. 24(1): 137-139 (1984) - [j9]Carl G. Jockusch Jr., Richard A. Shore:
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers. J. Symb. Log. 49(4): 1205-1236 (1984) - 1982
- [j8]Richard A. Shore:
On Homogeneity and Definability in the First-Order Theory of the Turing Degrees. J. Symb. Log. 47(1): 8-16 (1982) - 1978
- [j7]Richard A. Shore:
Controlling the Dependence Degree of a Recursive Enumerable Vector Space. J. Symb. Log. 43(1): 13-22 (1978) - [j6]Richard A. Shore:
Nowhere Simple Sets and the Lattice of Recursively Enumerable Sets. J. Symb. Log. 43(2): 322-330 (1978) - [j5]Richard A. Shore:
Some More Minimal Pairs of α-Recursively Enumerable Degrees. Math. Log. Q. 24(25-30): 409-418 (1978) - 1976
- [j4]Anne Leggett, Richard A. Shore:
Types of Simple alpha-Recursively Enumerable Sets. J. Symb. Log. 41(3): 681-694 (1976) - 1974
- [j3]Richard A. Shore:
sigman Sets which are trianglen-Incomparable (Uniformly). J. Symb. Log. 39(2): 295-304 (1974) - 1972
- [j2]E. M. Kleinberg, Richard A. Shore:
Weak Compactness and Square Bracket Partition Relations. J. Symb. Log. 37(4): 673-676 (1972) - 1971
- [j1]E. M. Kleinberg, Richard A. Shore:
On Large Cardinals and Partition Relations. J. Symb. Log. 36(2): 305-308 (1971)
Conference and Workshop Papers
- 2017
- [c5]Leo Harrington, Richard A. Shore, Theodore A. Slaman:
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity 2017: 455-466 - 1999
- [c4]Joseph Y. Halpern, Richard A. Shore:
Reasoning about Common Knowledge with Infinitely Many Agents. LICS 1999: 384-393 - 1996
- [c3]Bakhadyr Khoussainov, Richard A. Shore:
Categoricity and Scott Families. DMTCS 1996: 299-307 - 1995
- [c2]Peter Cholak, Rod Downey, Richard A. Shore:
Intervals Without Critical Triples. Logic Colloquium 1995: 17-43 - 1989
- [c1]Richard A. Shore, Theodore A. Slaman:
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. SCT 1989: 68-76
Parts in Books or Collections
- 1999
- [p1]Richard A. Shore:
The Recursively Enumerable Degrees. Handbook of Computability Theory 1999: 169-197
Informal and Other Publications
- 2002
- [i2]Samuel R. Buss, Alexander S. Kechris, Anand Pillay, Richard A. Shore:
The prospects for mathematical logic in the twenty-first century. CoRR cs.LO/0205003 (2002) - 1999
- [i1]Joseph Y. Halpern, Richard A. Shore:
Reasoning About Common Knowledge with Infinitely Many Agents. CoRR cs.LO/9909014 (1999)
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-07-09 03:26 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:
