Citation Impact
Citing Papers
Equity of access to health care services:
2001 Standout
Degrees in Which the Recursive Sets are Uniformly Recursive
1972
Health checks in general practice: another example of inverse care?
1990
Some theorems on R-maximal sets and major subsets of recursively enumerable sets
1971
Registration health checks: inverse care in the inner city?
1994
The weak truth table degrees of recursively enumerable sets
1975
Simplicity of recursively enumerable sets
1967
A recursively enumerable degree which will not split over all lesser ones
1976
Deficiency Sets and Bounded Information Reducibilities
1974
A threshold of ln n for approximating set cover
1998 Standout
Jump Restricted Interpolation in the Recursively Enumerable Degrees
1971
On the Degrees of Index Sets. II
1969
Interpolation and Embedding in the Recursively Enumerable Degrees
1971
Two theorems on hyperhypersimple sets
1967
The impossibility of finding relative complements for recursively enumerable degrees
1966
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
1966
On the degrees of index sets. II
1969
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
1988
A Contextual-Hierarchical Approach to Truth and the Liar Paradox
2004
The Logic of Conventional Implicatures
2004 Standout
Knowledge and Practical Interests
2005 Standout
Distributive Initial Segments of the Degrees of Unsolvability
1968
r-Maximal major subsets
1978
On a question of G. E. Sacks
1966
Recursively enumerable sets and degrees
1978 Standout
Lambda Calculus with Types
2013
Nowhere simple sets and the lattice of recursively enumerable sets
1978
On a Class of Complete Simple Sets
1965
Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets
1974
A minimal pair of recursively enumerable degrees
1966
The class of recursively enumerable subsets of a recursively enumerable set
1973
Degrees of members of Π10classes
1972
Automorphisms of the lattice of recursively enumerable sets
1974
Mitotic recursively enumerable sets
1973
Recursively enumerable vector spaces
1977
Deficiency sets and bounded information reducibilities
1974
Determining automorphisms of the recursively enumerable sets
1977
Computational complexity, speedable and levelable sets
1977
Hypersimple sets with retraceable complements
1971
Uniform enumeration operations
1975
A minimal pair of Π10 classes
1971
Two Theorems on Hyperhypersimple Sets
1967
On a problem of G. E. Sacks
1965
On the Degrees of Index Sets
1966
The decision problem for recursively enumerable degrees
1975
Π⁰₁ classes and degrees of theories
1972
The Priority Method I
1967
Banach–Mazur games, comeager sets and degrees of unsolvability
1976
Completeness, the recursion theorem, and effectively simple sets
1966
The infinite injury priority method
1976
Entanglement detection
2009 Standout
The Friedberg-Muchnik Theorem Re-Examined
1972
On a Problem of G. E. Sacks
1965
A Dichotomy of the Recursively Enumerable Sets
1968
Works of Gerald E. Sacks being referenced
Evaluation of a practice-based programme of health checks: financial cost and success at risk detection.
1989
On a theorem of Lachlan and Martin
1967
Recursive enumerability and the jump operator
1963
The α-finite injury method
1972
A maximal set which is not complete.
1964
Degrees of Unsolvability. (AM-55)
1964
On the Degrees Less than 0 �
1963
A minimal degree less than 0’
1961
Recursive Enumerability and the Jump Operator
1963
A simple set which is not effectively simple
1964
Logic and Computer Science
1990
The Recursively Enumerable Degrees are Dense
1964
A Simple Set Which is Not Effectively Simple
1964
Higher Recursion Theory
2017
Degrees of Unsolvability.
1965
On a Theorem of Lachlan and Martin
1967