Stephen G. Simpson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 44 from 44

2017

Reverse Mathematics, Young Diagrams, and the ascending Chain conditionKostas Hatzikiriakou, Stephen G. Simpson. JSYML, 82(2):576-589, 2017. [doi]

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR FunctionsStephen G. Simpson. BIRTHDAY 2017: 660-668 [doi]

2016

Mass problems and intuitionistic higher-order logicSankha S. Basu, Stephen G. Simpson. computability, 5(1):29-47, 2016. [doi]

Mass problems and densityStephen Binns, Richard A. Shore, Stephen G. Simpson. jml, 16(2):1650006, 2016. [doi]

Implicit Definability in ArithmeticStephen G. Simpson. ndjfl, 57(3):329-339, 2016. [doi]

2015

Symbolic Dynamics: Entropy = Dimension = ComplexityStephen G. Simpson. mst, 56(3):527-543, 2015. [doi]

Cone avoidance and randomness preservationStephen G. Simpson, Frank Stephan. APAL, 166(6):713-728, 2015. [doi]

Degrees of Unsolvability: A TutorialStephen G. Simpson. CiE 2015: 83-94 [doi]

2014

Propagation of partial randomnessKojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson, Keita Yokoyama. APAL, 165(2):742-758, 2014. [doi]

1-InductionStephen G. Simpson. ndjfl, 55(1):75-78, 2014. [doi]

2013

Reverse mathematics and Peano categoricityStephen G. Simpson, Keita Yokoyama. APAL, 164(3):284-293, 2013. [doi]

2011

A Nonstandard Counterpart of WWKLStephen G. Simpson, Keita Yokoyama. ndjfl, 52(3):229-243, 2011. [doi]

2009

Mass problems and measure-theoretic regularityStephen G. Simpson. bsl, 15(4):385-409, 2009. [doi]

2008

Mass Problems and IntuitionismStephen G. Simpson. ndjfl, 49(2):127-136, 2008. [doi]

2007

Mass Problems and HyperarithmeticityJoshua A. Cole, Stephen G. Simpson. jml, 7(2), 2007. [doi]

Almost everywhere domination and superhighnessStephen G. Simpson. mlq, 53(4-5):462-482, 2007. [doi]

Mass problems and almost everywhere dominationStephen G. Simpson. mlq, 53(4-5):483-492, 2007. [doi]

2005

Reverse mathematics and pi:::1:::::2:: comprehensionCarl Mummert, Stephen G. Simpson. bsl, 11(4):526-533, 2005. [doi]

Mass problems and randomnessStephen G. Simpson. bsl, 11(1):1-27, 2005. [doi]

2004

Embeddings into the Medvedev and Muchnik lattices of pi:::0:::::1::classesStephen Binns, Stephen G. Simpson. AML, 43(3):399-414, 2004. [doi]

Almost everywhere dominationNatasha Dobrinen, Stephen G. Simpson. JSYML, 69(3):914-922, 2004. [doi]

An incompleteness theorem for gamma::n::-modelsCarl Mummert, Stephen G. Simpson. JSYML, 69(2):612-616, 2004. [doi]

2002

Vitali s Theorem and WWKLDouglas K. Brown, Mariagnese Giusto, Stephen G. Simpson. AML, 41(2):191-206, 2002. [doi]

Some conservation results on week König s lemmaStephen G. Simpson, Kazuyuki Tanaka, Takeshi Yamazaki. APAL, 118(1-2):87-114, 2002.

2000

Located Sets and Reverse MathematicsMariagnese Giusto, Stephen G. Simpson. JSYML, 65(3):1451-1480, 2000.

1999

Separation and Weak König s LemmaA. James Humphreys, Stephen G. Simpson. JSYML, 64(1):268-278, 1999.

Subsystems of second order arithmeticStephen G. Simpson. Perspectives in mathematical logic, Springer, 1999.

1994

On the Strength of KÃ¶nig s Duality Theorem for Countable Bipartite GraphsStephen G. Simpson. JSYML, 59(1):113-123, 1994.

1993

The Baire Category Theorem in Weak Subsystems of Second-Order ArithmeticDouglas K. Brown, Stephen G. Simpson. JSYML, 58(2):557-578, 1993.

Periodic Points and Subsystems of Second-Order ArithmeticHarvey Friedman, Stephen G. Simpson, Xiaokang Yu. APAL, 62(1):51-64, 1993.

1990

Measure theory and weak König's lemmaXiaokang Yu, Stephen G. Simpson. AML, 30(3):171-180, 1990. [doi]

1989

Countable Valued Fields in Weak Subsystems of Second-Order ArithmeticKostas Hatzikiriakou, Stephen G. Simpson. APAL, 41(1):27-32, 1989.

1988

Ordinal Numbers and the Hilbert Basis TheoremStephen G. Simpson. JSYML, 53(3):961-974, 1988.

Partial Realizations of Hilbert s ProgramStephen G. Simpson. JSYML, 53(2):349-363, 1988.

1986

Which set existence axioms are needed to prove the separable Hahn-Banach theorem?Douglas K. Brown, Stephen G. Simpson. APAL, 31:123-144, 1986. [doi]

0 inductionStephen G. Simpson, Rick L. Smith. APAL, 31:289-306, 1986. [doi]

1985

Addendum to "countable algebra and set existence axioms"Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith. APAL, 28(3):319-320, 1985. [doi]

Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen ZahlenKurt Schütte, Stephen G. Simpson. AML, 25(1):75-89, 1985. [doi]

Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher BäumeStephen G. Simpson. AML, 25(1):45-65, 1985. [doi]

1984

Which Set Existence Axioms are Needed to Prove the Cauchy/Peano Theorem for Ordinary Differential Equations?Stephen G. Simpson. JSYML, 49(3):783-802, 1984.

1983

Countable algebra and set existence axiomsHarvey M. Friedman, Stephen G. Simpson, Rick L. Smith. APAL, 25(2):141-181, 1983. [doi]

High and Low Kleene Degrees of Coanalytic SetsStephen G. Simpson, Galen Weitkamp. JSYML, 48(2):356-368, 1983.

1982

On the Role of Ramsey Quantifiers in First Order ArithmeticJames H. Schmerl, Stephen G. Simpson. JSYML, 47(2):423-435, 1982.

1978

Sets Which Do Not Have Subsets of Every Higher DegreeStephen G. Simpson. JSYML, 43(1):135-138, 1978.

Sign in or sign up to see more results.

runs on WebDSL