Stephen G. Simpson

According to our database, Stephen G. Simpson authored at least 45 papers between 1978 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Reverse Mathematics, Young Diagrams, and the ascending Chain condition.

Kostas Hatzikiriakou, Stephen G. Simpson

J. Symb. Log., 2017

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions.

Stephen G. Simpson

Proceedings of the Computability and Complexity, 2017

2016

Implicit Definability in Arithmetic.

Stephen G. Simpson

Notre Dame J. Formal Log., 2016

Mass problems and density.

Stephen Binns, Richard A. Shore, Stephen G. Simpson

J. Math. Log., 2016

Mass problems and intuitionistic higher-order logic.

Sankha S. Basu, Stephen G. Simpson

Comput., 2016

2015

Symbolic Dynamics: Entropy = Dimension = Complexity.

Stephen G. Simpson

Theory Comput. Syst., 2015

Cone avoidance and randomness preservation.

Stephen G. Simpson, Frank Stephan

Ann. Pure Appl. Log., 2015

Degrees of Unsolvability: A Tutorial.

Stephen G. Simpson

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Baire Categoricity and Σ⁰₁-Induction.

Stephen G. Simpson

Notre Dame J. Formal Log., 2014

Propagation of partial randomness.

Kojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson, Keita Yokoyama

Ann. Pure Appl. Log., 2014

2013

Reverse mathematics and Peano categoricity.

Stephen G. Simpson, Keita Yokoyama

Ann. Pure Appl. Log., 2013

2011

A Nonstandard Counterpart of WWKL.

Stephen G. Simpson, Keita Yokoyama

Notre Dame J. Formal Log., 2011

2009

Mass problems and measure-theoretic regularity.

Stephen G. Simpson

Bull. Symb. Log., 2009

2008

Mass Problems and Intuitionism.

Stephen G. Simpson

Notre Dame J. Formal Log., 2008

2007

Mass problems and almost everywhere domination.

Stephen G. Simpson

Math. Log. Q., 2007

Almost everywhere domination and superhighness.

Stephen G. Simpson

Math. Log. Q., 2007

Mass Problems and Hyperarithmeticity.

Joshua A. Cole, Stephen G. Simpson

J. Math. Log., 2007

2005

Mass problems and randomness.

Stephen G. Simpson

Bull. Symb. Log., 2005

Reverse mathematics and pi¹₂ comprehension.

Carl Mummert, Stephen G. Simpson

Bull. Symb. Log., 2005

2004

An incompleteness theorem for gamma_n-models.

Carl Mummert, Stephen G. Simpson

J. Symb. Log., 2004

Almost everywhere domination.

Natasha Dobrinen, Stephen G. Simpson

J. Symb. Log., 2004

Embeddings into the Medvedev and Muchnik lattices of pi⁰₁classes.

Stephen Binns, Stephen G. Simpson

Arch. Math. Log., 2004

2002

Some conservation results on week König's lemma.

Stephen G. Simpson, Kazuyuki Tanaka, Takeshi Yamazaki

Ann. Pure Appl. Log., 2002

Vitali's Theorem and WWKL.

Douglas K. Brown, Mariagnese Giusto, Stephen G. Simpson

Arch. Math. Log., 2002

2000

Located Sets and Reverse Mathematics.

Mariagnese Giusto, Stephen G. Simpson

J. Symb. Log., 2000

1999

Separation and Weak König's Lemma.

A. James Humphreys, Stephen G. Simpson

J. Symb. Log., 1999

Subsystems of second order arithmetic.

Stephen G. Simpson

Perspectives in mathematical logic, Springer, ISBN: 978-3-540-64882-6, 1999

1994

On the Strength of König's Duality Theorem for Countable Bipartite Graphs.

Stephen G. Simpson

J. Symb. Log., 1994

1993

The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic.

Douglas K. Brown, Stephen G. Simpson

J. Symb. Log., 1993

Periodic Points and Subsystems of Second-Order Arithmetic.

Harvey Friedman, Stephen G. Simpson, Xiaokang Yu

Ann. Pure Appl. Log., 1993

1990

Measure theory and weak König's lemma.

Xiaokang Yu, Stephen G. Simpson

Arch. Math. Log., 1990

1989

Countable Valued Fields in Weak Subsystems of Second-Order Arithmetic.

Kostas Hatzikiriakou, Stephen G. Simpson

Ann. Pure Appl. Log., 1989

1988

Ordinal Numbers and the Hilbert Basis Theorem.

Stephen G. Simpson

J. Symb. Log., 1988

Partial Realizations of Hilbert's Program.

Stephen G. Simpson

J. Symb. Log., 1988

1986

A dual form of Erdös-Rado's canonization theorem.

Hans Jürgen Prömel, Stephen G. Simpson, Bernd Voigt

J. Comb. Theory, Ser. A, 1986

Factorization of polynomials and Σ₁⁰ induction.

Stephen G. Simpson, Rick L. Smith

Ann. Pure Appl. Log., 1986

Which set existence axioms are needed to prove the separable Hahn-Banach theorem?

Douglas K. Brown, Stephen G. Simpson

Ann. Pure Appl. Log., 1986

1985

Addendum to "countable algebra and set existence axioms".

Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith

Ann. Pure Appl. Log., 1985

Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume.

Stephen G. Simpson

Arch. Math. Log., 1985

Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen.

Kurt Schütte, Stephen G. Simpson

Arch. Math. Log., 1985

1984

Which Set Existence Axioms are Needed to Prove the Cauchy/Peano Theorem for Ordinary Differential Equations?

Stephen G. Simpson

J. Symb. Log., 1984

1983

High and Low Kleene Degrees of Coanalytic Sets.

Stephen G. Simpson, Galen Weitkamp

J. Symb. Log., 1983

Countable algebra and set existence axioms.

Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith

Ann. Pure Appl. Log., 1983

1982

On the Role of Ramsey Quantifiers in First Order Arithmetic.

James H. Schmerl, Stephen G. Simpson

J. Symb. Log., 1982

1978

Sets Which Do Not Have Subsets of Every Higher Degree.

Stephen G. Simpson

J. Symb. Log., 1978