Richard Kaye

According to our database1, Richard Kaye authored at least 22 papers between 1989 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
The Model Theory of Generic Cuts.
Proceedings of the Logic Without Borders, 2015

2014
Interpretations between ω-Logic and second-order Arithmetic.
J. Symb. Log., 2014

2013
The arithmetic of cuts in models of arithmetic.
Math. Log. Q., 2013

2012
Transplendent Models: Expansions Omitting a Type.
Notre Dame Journal of Formal Logic, 2012

Amphi-ZF : axioms for Conway games.
Arch. Math. Log., 2012

2010
Truth in generic cuts.
Ann. Pure Appl. Logic, 2010

2008
Generic cuts in models of arithmetic.
Math. Log. Q., 2008

2007
On Interpretations of Arithmetic and Set Theory.
Notre Dame Journal of Formal Logic, 2007

Normal subgroups of nonstandard symmetric and alternating groups.
Arch. Math. Log., 2007

2000
On Models Constructed by Means of the Arithmetized Completeness Theorem.
Math. Log. Q., 2000

1997
Infinitary Definitions of Equivalence Relations in Models of PA.
Ann. Pure Appl. Logic, 1997

1995
The Theory of κ-like Models of Arithmetic.
Notre Dame Journal of Formal Logic, 1995

1994
Automorphisms of Models of True Arithmetic: Recognizing Some Basic Open Subgroups.
Notre Dame Journal of Formal Logic, 1994

1993
Hilbert's Tenth Problem for Weak Theories of Arithmetic.
Ann. Pure Appl. Logic, 1993

1991
On Cofinal Extensions of Models of Fragments of Arithmetic.
Notre Dame Journal of Formal Logic, 1991

Model-Theoretic Properties Characterizing Peano Arithmetic.
J. Symb. Log., 1991

A Generalization of Specker's Theorem on Typical Ambiguity.
J. Symb. Log., 1991

End-Extensions Preserving Power Set.
J. Symb. Log., 1991

Automorphisms of Recursively Saturated Models of Arithmetic.
Ann. Pure Appl. Logic, 1991

Models of Peano arithmetic.
Oxford logic guides 15, Clarendon Press, ISBN: 978-0-19-853213-2, 1991

1990
Diophantine Induction.
Ann. Pure Appl. Logic, 1990

1989
Parameter-Free Universal Induction.
Math. Log. Q., 1989


  Loading...