Robert Solovay

According to our database1, Robert Solovay authored at least 16 papers between 1975 and 2017.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Strong measure zero and infinite games.
Arch. Math. Log., 2017

2012
Some new results on decidability for elementary algebra and geometry.
Ann. Pure Appl. Log., 2012

2000
A Version of Ω for which ZFC Cannot Predict a Single Bit.
Proceedings of the Finite Versus Infinite, 2000

1994
Extremes in the Degrees of Inferability.
Ann. Pure Appl. Log., 1994

1992
Learning vi Queries in [+, <].
J. Symb. Log., 1992

1991
When Oracles Do Not Help.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990
Learning Via Queries in [+, <].
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989
Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.
J. Symb. Log., 1989

Injecting Inconsistencies into Models of PA.
Ann. Pure Appl. Log., 1989

1985
Explicit Henkin Sentences.
J. Symb. Log., 1985

1978
Erratum: A Fast Monte-Carlo Test for Primality.
SIAM J. Comput., 1978

1977
A Fast Monte-Carlo Test for Primality.
SIAM J. Comput., 1977

Definability of Measures and Ultrafilters.
J. Symb. Log., 1977

1976
On Sets Cook-Reducible to Sparse Sets.
SIAM J. Comput., 1976

1975
Relativizations of the P =? NP Question.
SIAM J. Comput., 1975

On Partitions into Stationary Sets.
J. Symb. Log., 1975


  Loading...