default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Kaye
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[p1]Richard Kaye, Tin Lok Wong:
The Model Theory of Generic Cuts. Logic Without Borders 2015: 281-296- 2014
- [j21]Richard Kaye:
Circularity in Soundness and Completeness. Bull. Symb. Log. 20(1): 24-38 (2014) - [j20]Richard Kaye:
Interpretations between ω-Logic and second-order Arithmetic. J. Symb. Log. 79(3): 845-858 (2014) - 2013
- [j19]Richard Kaye:
The arithmetic of cuts in models of arithmetic. Math. Log. Q. 59(4-5): 332-351 (2013) - 2012
- [j18]Michael Cox, Richard Kaye:
Amphi-ZF : axioms for Conway games. Arch. Math. Log. 51(3-4): 353-371 (2012) - [j17]Fredrik Engström
, Richard Kaye:
Transplendent Models: Expansions Omitting a Type. Notre Dame J. Formal Log. 53(3): 413-428 (2012) - 2010
- [j16]Richard Kaye, Tin Lok Wong:
Truth in generic cuts. Ann. Pure Appl. Log. 161(8): 987-1005 (2010)
2000 – 2009
- 2008
- [j15]Richard Kaye:
Generic cuts in models of arithmetic. Math. Log. Q. 54(2): 129-144 (2008) - 2007
- [j14]John Allsup, Richard Kaye:
Normal subgroups of nonstandard symmetric and alternating groups. Arch. Math. Log. 46(2): 107-121 (2007) - [j13]Richard Kaye, Tin Lok Wong:
On Interpretations of Arithmetic and Set Theory. Notre Dame J. Formal Log. 48(4): 497-510 (2007) - 2000
- [j12]Richard Kaye, Henryk Kotlarski:
On Models Constructed by Means of the Arithmetized Completeness Theorem. Math. Log. Q. 46(4): 505-516 (2000)
1990 – 1999
- 1997
- [j11]Richard Kaye:
Infinitary Definitions of Equivalence Relations in Models of PA. Ann. Pure Appl. Log. 89(1): 37-43 (1997) - 1995
- [j10]Richard Kaye:
The Theory of κ-like Models of Arithmetic. Notre Dame J. Formal Log. 36(4): 547-559 (1995) - 1994
- [j9]Henryk Kotlarski, Richard Kaye:
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups. Notre Dame J. Formal Log. 35(1): 1-14 (1994) - 1993
- [j8]Richard Kaye:
Hilbert's Tenth Problem for Weak Theories of Arithmetic. Ann. Pure Appl. Log. 61(1-2): 63-73 (1993) - 1991
- [b1]Richard Kaye:
Models of Peano arithmetic. Oxford logic guides 15, Clarendon Press 1991, ISBN 978-0-19-853213-2, pp. I-X, 1-292 - [j7]Richard Kaye, Roman Kossak, Henryk Kotlarski:
Automorphisms of Recursively Saturated Models of Arithmetic. Ann. Pure Appl. Log. 55(1): 67-99 (1991) - [j6]Thomas Forster, Richard Kaye:
End-Extensions Preserving Power Set. J. Symb. Log. 56(1): 323-328 (1991) - [j5]Richard Kaye:
A Generalization of Specker's Theorem on Typical Ambiguity. J. Symb. Log. 56(2): 458-466 (1991) - [j4]Richard Kaye:
Model-Theoretic Properties Characterizing Peano Arithmetic. J. Symb. Log. 56(3): 949-963 (1991) - [j3]Richard Kaye:
On Cofinal Extensions of Models of Fragments of Arithmetic. Notre Dame J. Formal Log. 32(3): 399-408 (1991) - 1990
- [j2]Richard Kaye:
Diophantine Induction. Ann. Pure Appl. Log. 46(1): 1-40 (1990)
1980 – 1989
- 1989
- [j1]Richard Kaye:
Parameter-Free Universal Induction. Math. Log. Q. 35(5): 443-456 (1989)
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-04-25 05:51 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:
