<--- Back to Details
First PageDocument Content
Computability theory / Effective descriptive set theory / Functions and mappings / Function / Reverse mathematics / Second-order arithmetic / Constructivism / Impredicativity / Peano axioms / Mathematics / Mathematical logic / Logic
Date: 2002-11-18 18:14:48
Computability theory
Effective descriptive set theory
Functions and mappings
Function
Reverse mathematics
Second-order arithmetic
Constructivism
Impredicativity
Peano axioms
Mathematics
Mathematical logic
Logic

Add to Reading List

Source URL: math.stanford.edu

Download Document from Source Website

File Size: 96,53 KB

Share Document on Facebook

Similar Documents

A MODEL OF SECOND-ORDER ARITHMETIC SATISFYING AC BUT NOT DC SY-DAVID FRIEDMAN AND VICTORIA GITMAN Abstract. We show that there is a β-model of second-order arithmetic in which the choice scheme holds, but the dependent

DocID: 1uyPX - View Document

Mathematics / Mathematical logic / Logic / Foundations of mathematics / Z notation / ZermeloFraenkel set theory / Determinacy / Set theory / Second-order arithmetic / Constructible universe / Model theory / Descriptive set theory

Introduction Descriptive Set Theory in SOA Collapsing a model of ZFC Sharps # Collapsing a model of ZFC

DocID: 1qsyF - View Document

Proof theory / Computability theory / Logic in computer science / Mathematical logic / Intuitionism / Primitive recursive functional / Dialectica interpretation / Peano axioms / Second-order arithmetic / Reverse mathematics / Combinatory logic / Primitive recursive arithmetic

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

DocID: 1okaY - View Document

Mathematics / Ergodic theory / Ramsey theory / Semigroup theory / Lemmas / Combinatorics / Piecewise syndetic set / Partition regularity / Syndetic set / Diagonal lemma / IP set / BanachAlaoglu theorem

BROWN’S LEMMA IN SECOND-ORDER ARITHMETIC EMANUELE FRITTAION Abstract. We show that Brown’s lemma is equivalent to IΣ02 over RCA∗0 . We also show that (the infinite) van der Waerden’s theorem is equivalent to BΣ

DocID: 1ofdc - View Document

Investigations of Subsystems of Second Order Arithmetic and Set Theory in Strength between Π11 -CA and ∆12 -CA + BI: Part I Michael Rathjen Department of Pure Mathematics University of Leeds

DocID: 1nSUJ - View Document