Faculty

Institution

Unit

Venue

Stephen G. Simpson

Emeritus Professor of Mathematics

Pennsylvania State University

Affiliations

Eberly College of Science

Department of Mathematics

Stephen G. Simpson is currently serving as a Mathematics Emeritus Professor of Mathematics at Pennsylvania State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Stephen G. Simpson

Pennsylvania State University

Emeritus Professor of Mathematics

You can click a keyword to filter the displayed items

mathematics mathematical logic applied mathematics logic in computer science foundation of mathematics computer science computational complexity applied logic mass problems pure mathematics linguistics combinatorics classical logic computational complexity theory reverse mathematics number theory formal methods combinatorial theory automated reasoning algorithmic information theory probability theory set theory spectral theory mathematical sciences algebraic combinatorics fuzzy logic measure theory analytic number theory higher-order logic global analysis sat solving philosophy of logic formal theory second order arithmetic dual form countable algebra existence axioms weak subsystems admissible ordinals machine learning research mathematical optimization approximate reasoning mathematics education high energy physics steel research entropy internal medicine symptom management medical history survivability proof theory theoretical analysis matrix factorization lattice theory interpretability language comprehension extremal set theory theoretical prediction information propagation function theory partial evaluation algebraic analysis proof complexity conceptual analysis infinite dimensional analysis logical formalism hierarchical classification order theory nsf grants partial realizations ramsey theory ordinal numbers hilbert basis theorem predicative analysis finite combinatorial principle first-order theory automated deduction computability theory recursion theory

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

Reverse Mathematics. Springer eBooks (2024)

John Stillwell

pure mathematicsreverse mathematicscomputational complexitymathematics

Foundations of Mathematics: An Optimistic Message. Springer eBooks (2020)

Stephen G. Simpson

foundational theorytheoretical mathematicsapplied mathematicspure mathematicsmathematicsfoundation of mathematicsfoundational calculusoptimistic messagemathematical sciences

Arithmetical Comprehension. Princeton University Press eBooks (2019)

John Stillwell

applied mathematicsarithmetical comprehensionmachine learningmathematicscognitive science

Reverse Mathematics, Young Diagrams, and the Ascending Chain Condition. Journal of Symbolic Logic (2017)

KOSTAS HATZIKIRIAKOUSTEPHEN G. SIMPSON

computational complexitymathematicsyoung diagramsreverse mathematicsmathematical logicascending chain condition

Special Section: Computability Theory and the Foundation of Mathematics. Annals of the Japan Association for Philosophy of Science (2017)

Chi Tat CHONGStephen G. SIMPSON

special sectioncomputability theoryphilosophy of mathematicsmathematicsfoundation of mathematicsphilosophy of science

Symbolic Dynamics: Entropy = Dimension = Complexity. arXiv (Cornell University) (2017)

Stephen G. Simpson

entropycomplexity sciencecomplexity theorydynamical systemsmathematics

Π 0 1 Sets and Models of Wkl 0. Cambridge University Press eBooks (2017)

Stephen G. Simpson

computer sciencetheory of computationhigher-order logicmathematical logiclogic in computer science

Implicit Definability in Arithmetic. Notre Dame Journal of Formal Logic (2016)

Stephen G. Simpson

formal theorylogic in computer sciencemathematicsimplicit definabilityclassical logicformal mathematical reasoningmathematical logicformal methods

Mass Problems and Density. Journal of Mathematical Logic (2016)

Stephen BinnsRichard A. ShoreStephen G. Simpson

mass problemsapplied mathematicsmathematical logic

Mass Problems and Intuitionistic Higher-Order Logic. Computability (2016)

Sankha S. BasuStephen G. Simpson

mass problemscomputer sciencehigher-order logicmathematical logicintuitionistic higher-order logic

1
2
3
4
5
9
10 / page

Stephen G. Simpson

Emeritus Professor of Mathematics

Pennsylvania State University

Affiliations

Eberly College of Science

Department of Mathematics

Stephen G. Simpson is currently serving as a Mathematics Emeritus Professor of Mathematics at Pennsylvania State University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Stephen G. Simpson

Pennsylvania State University

Emeritus Professor of Mathematics

You can click a keyword to filter the displayed items

Video Presentations

Notable Scholarly Works

Notable Federal Grants

Collaborators

Reverse Mathematics. Springer eBooks (2024)

John Stillwell

pure mathematicsreverse mathematicscomputational complexitymathematics

Foundations of Mathematics: An Optimistic Message. Springer eBooks (2020)

Stephen G. Simpson

foundational theorytheoretical mathematicsapplied mathematicspure mathematicsmathematicsfoundation of mathematicsfoundational calculusoptimistic messagemathematical sciences

Arithmetical Comprehension. Princeton University Press eBooks (2019)

John Stillwell

applied mathematicsarithmetical comprehensionmachine learningmathematicscognitive science

Reverse Mathematics, Young Diagrams, and the Ascending Chain Condition. Journal of Symbolic Logic (2017)

KOSTAS HATZIKIRIAKOUSTEPHEN G. SIMPSON

computational complexitymathematicsyoung diagramsreverse mathematicsmathematical logicascending chain condition

Special Section: Computability Theory and the Foundation of Mathematics. Annals of the Japan Association for Philosophy of Science (2017)

Chi Tat CHONGStephen G. SIMPSON

special sectioncomputability theoryphilosophy of mathematicsmathematicsfoundation of mathematicsphilosophy of science

Symbolic Dynamics: Entropy = Dimension = Complexity. arXiv (Cornell University) (2017)

Stephen G. Simpson

entropycomplexity sciencecomplexity theorydynamical systemsmathematics

Π 0 1 Sets and Models of Wkl 0. Cambridge University Press eBooks (2017)

Stephen G. Simpson

computer sciencetheory of computationhigher-order logicmathematical logiclogic in computer science

Implicit Definability in Arithmetic. Notre Dame Journal of Formal Logic (2016)

Stephen G. Simpson

formal theorylogic in computer sciencemathematicsimplicit definabilityclassical logicformal mathematical reasoningmathematical logicformal methods

Mass Problems and Density. Journal of Mathematical Logic (2016)

Stephen BinnsRichard A. ShoreStephen G. Simpson

mass problemsapplied mathematicsmathematical logic

Mass Problems and Intuitionistic Higher-Order Logic. Computability (2016)

Sankha S. BasuStephen G. Simpson

mass problemscomputer sciencehigher-order logicmathematical logicintuitionistic higher-order logic

1
2
3
4
5
9
10 / page

Similar Faculty Members

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Theodore A. Slaman

Institution

University of California, Berkeley

partial computations

logic in computer science

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Thomas Jech

Institution

Pennsylvania State University

mathematics

mathematics education

Jeremy Avigad

Institution

Carnegie Mellon University

mathematical logic

formal verification

Samuel R. Buss

Institution

University of California, San Diego

mathematical logic

logic in computer science

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory

Similar Faculty Members

Yiannis N. Moschovakis

Institution

University of California, Los Angeles

philosophy of language

philosophical logic

Harvey Friedman

Institution

Ohio State University

philosophy

general system

Theodore A. Slaman

Institution

University of California, Berkeley

partial computations

logic in computer science

Antonio Montalban

Institution

University of California, Berkeley

mathematics

applied mathematics

Peter Cholak

Institution

University of Notre Dame

extremal set theory

discrete algorithm

Thomas Jech

Institution

Pennsylvania State University

mathematics

mathematics education

Jeremy Avigad

Institution

Carnegie Mellon University

mathematical logic

formal verification

Samuel R. Buss

Institution

University of California, San Diego

mathematical logic

logic in computer science

Dhruv Mubayi

Institution

University of Illinois Chicago

computational problem

probabilistic graph theory