Stephen G. Simpson

Publication Activity (10 Years)

Years Active: 1978-2017
Publications (10 Years): 8

Top Topics

Sequence Prediction

Graphical Representations

Top Venues

Ann. Pure Appl. Log.

Notre Dame J. Formal Log.

Theory Comput. Syst.

Publications

Stephen G. Simpson
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. Computability and Complexity (2017)
Kostas Hatzikiriakou, Stephen G. Simpson
Reverse Mathematics, Young Diagrams, and the ascending Chain condition. J. Symb. Log. 82 (2) (2017)
Stephen G. Simpson
Implicit Definability in Arithmetic. Notre Dame J. Formal Log. 57 (3) (2016)
Sankha S. Basu, Stephen G. Simpson
Mass problems and intuitionistic higher-order logic. Comput. 5 (1) (2016)
Stephen Binns, Richard A. Shore, Stephen G. Simpson
Mass problems and density. J. Math. Log. 16 (2) (2016)
Stephen G. Simpson, Frank Stephan
Cone avoidance and randomness preservation. Ann. Pure Appl. Log. 166 (6) (2015)
Stephen G. Simpson
Symbolic Dynamics: Entropy = Dimension = Complexity. Theory Comput. Syst. 56 (3) (2015)
Stephen G. Simpson
Degrees of Unsolvability: A Tutorial. CiE (2015)
Kojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson, Keita Yokoyama
Propagation of partial randomness. Ann. Pure Appl. Log. 165 (2) (2014)
Stephen G. Simpson
-Induction. Notre Dame J. Formal Log. 55 (1) (2014)
Stephen G. Simpson, Keita Yokoyama
Reverse mathematics and Peano categoricity. Ann. Pure Appl. Log. 164 (3) (2013)
Stephen G. Simpson, Keita Yokoyama
A Nonstandard Counterpart of WWKL. Notre Dame J. Formal Log. 52 (3) (2011)
Stephen G. Simpson
Mass problems and measure-theoretic regularity. Bull. Symb. Log. 15 (4) (2009)
Stephen G. Simpson
Mass Problems and Intuitionism. Notre Dame J. Formal Log. 49 (2) (2008)
Stephen G. Simpson
Almost everywhere domination and superhighness. Math. Log. Q. 53 (4-5) (2007)
Joshua A. Cole, Stephen G. Simpson
Mass Problems and Hyperarithmeticity. J. Math. Log. 7 (2) (2007)
Stephen G. Simpson
Mass problems and almost everywhere domination. Math. Log. Q. 53 (4-5) (2007)
Stephen G. Simpson
Mass problems and randomness. Bull. Symb. Log. 11 (1) (2005)
Carl Mummert, Stephen G. Simpson
comprehension. Bull. Symb. Log. 11 (4) (2005)
Carl Mummert, Stephen G. Simpson
-models. J. Symb. Log. 69 (2) (2004)
Natasha Dobrinen, Stephen G. Simpson
Almost everywhere domination. J. Symb. Log. 69 (3) (2004)
Stephen Binns, Stephen G. Simpson
classes. Arch. Math. Log. 43 (3) (2004)
Stephen G. Simpson, Kazuyuki Tanaka, Takeshi Yamazaki
Some conservation results on week König's lemma. Ann. Pure Appl. Log. 118 (1-2) (2002)
Douglas K. Brown, Mariagnese Giusto, Stephen G. Simpson
Vitali's Theorem and WWKL. Arch. Math. Log. 41 (2) (2002)
Mariagnese Giusto, Stephen G. Simpson
Located Sets and Reverse Mathematics. J. Symb. Log. 65 (3) (2000)
A. James Humphreys, Stephen G. Simpson
Separation and Weak König's Lemma. J. Symb. Log. 64 (1) (1999)
Stephen G. Simpson
On the Strength of König's Duality Theorem for Countable Bipartite Graphs. J. Symb. Log. 59 (1) (1994)
Harvey Friedman, Stephen G. Simpson, Xiaokang Yu
Periodic Points and Subsystems of Second-Order Arithmetic. Ann. Pure Appl. Log. 62 (1) (1993)
Douglas K. Brown, Stephen G. Simpson
The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic. J. Symb. Log. 58 (2) (1993)
Xiaokang Yu, Stephen G. Simpson
Measure theory and weak König's lemma. Arch. Math. Log. 30 (3) (1990)
Kostas Hatzikiriakou, Stephen G. Simpson
Countable Valued Fields in Weak Subsystems of Second-Order Arithmetic. Ann. Pure Appl. Log. 41 (1) (1989)
Stephen G. Simpson
Ordinal Numbers and the Hilbert Basis Theorem. J. Symb. Log. 53 (3) (1988)
Stephen G. Simpson
Partial Realizations of Hilbert's Program. J. Symb. Log. 53 (2) (1988)
Douglas K. Brown, Stephen G. Simpson
Which set existence axioms are needed to prove the separable Hahn-Banach theorem? Ann. Pure Appl. Log. 31 (1986)
Stephen G. Simpson, Rick L. Smith
induction. Ann. Pure Appl. Log. 31 (1986)
Hans Jürgen Prömel, Stephen G. Simpson, Bernd Voigt
A dual form of Erdös-Rado's canonization theorem. J. Comb. Theory, Ser. A 42 (2) (1986)
Stephen G. Simpson
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume. Arch. Math. Log. 25 (1) (1985)
Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith
Addendum to "countable algebra and set existence axioms". Ann. Pure Appl. Log. 28 (3) (1985)
Kurt Schütte, Stephen G. Simpson
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen. Arch. Math. Log. 25 (1) (1985)
Stephen G. Simpson
Which Set Existence Axioms are Needed to Prove the Cauchy/Peano Theorem for Ordinary Differential Equations? J. Symb. Log. 49 (3) (1984)
Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith
Countable algebra and set existence axioms. Ann. Pure Appl. Log. 25 (2) (1983)
Stephen G. Simpson, Galen Weitkamp
High and Low Kleene Degrees of Coanalytic Sets. J. Symb. Log. 48 (2) (1983)
James H. Schmerl, Stephen G. Simpson
On the Role of Ramsey Quantifiers in First Order Arithmetic. J. Symb. Log. 47 (2) (1982)
Stephen G. Simpson
Sets Which Do Not Have Subsets of Every Higher Degree. J. Symb. Log. 43 (1) (1978)