#### Filter Results:

- Full text PDF available (83)

#### Publication Year

1978

2017

- This year (2)
- Last five years (23)

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

Foundations of mathematics is the study of the most basic concepts and logical structure of mathematics, with an eye to the unity of human knowledge. Almost all of the problems studied in this book are motivated by an overriding foundational question: What are the appropriate axioms for mathematics? Through a series of case studies, these axioms are… (More)

- Stephen G. Simpson
- Bulletin of Symbolic Logic
- 2005

to thank Stephen Binns for discussing these topics with me. Abstract A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P is strongly reducible to Q if every member of Q Turing computes a member of P via a fixed Turing functional. The… (More)

- Harvey M. Friedman, Stephen G. Simpson, Rick L. Smith
- Ann. Pure Appl. Logic
- 1983

- Natasha Dobrinen, Stephen G. Simpson
- J. Symb. Log.
- 2004

A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2 ω with respect to the " fair coin " probability measure on 2 ω , and for all g : ω → ω Turing reducible to X, there exists f : ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other,… (More)

- Stephen G. Simpson
- J. Symb. Log.
- 1988

JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact support@jstor.org.. Association for… (More)

Let Pw and PM be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π 0 1 subsets of 2 ω , under Muchnik and Medvedev reducibility, respectively. We show that all countable distribu-tive lattices are lattice-embeddable below any non-zero element of Pw. We show that many countable distributive lattices are lattice-embeddable… (More)

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if for all Y ∈ Q there exists X ∈ P such that X is Turing reducible to Y. A weak degree is an equivalence class of mass problems under mutual weak reducibility. Let Pw be the lattice of weak degrees of mass problems associated with nonempty Π 0 1… (More)

- Xiaokang Yu, Stephen G. Simpson
- Arch. Math. Log.
- 1990

- Douglas K. Brown, Mariagnese Giusto, Stephen G. Simpson
- Arch. Math. Log.
- 2002

Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivity for open sets of reals is provable in RCA 0. We show that several well-known measure-theoretic propositions including the Vitali Covering Theorem are equivalent to WWKL over… (More)

We exhibit a close correspondence between L 1-computable functions and Schnorr tests. Using this correspondence, we prove that a point x ∈ [0, 1] d is Schnorr random if and only if the Lebesgue Differentiation Theorem holds at x for all L 1-computable functions f ∈ L 1 ([0, 1] d).