<--- Back to Details
First PageDocument Content
Mathematical logic / Quantification / Logic / Semantics / Peano axioms / Symbol / Constructible universe / Universal quantification / Interpretation / Uniform boundedness principle / Witness / Combinatory logic
Date: 2012-11-12 10:21:17
Mathematical logic
Quantification
Logic
Semantics
Peano axioms
Symbol
Constructible universe
Universal quantification
Interpretation
Uniform boundedness principle
Witness
Combinatory logic

PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Download Document from Source Website

File Size: 373,73 KB

Share Document on Facebook

Similar Documents

And the Winners Are... An Axiomatic Approach to Selection from a Set

And the Winners Are... An Axiomatic Approach to Selection from a Set

DocID: 1oYwm - View Document

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

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

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

DocID: 1o6FP - View Document

PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA  Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i

PROOF MINING: A SYSTEMATIC WAY OF ANALYSING PROOFS IN MATHEMATICS ULRICH KOHLENBACH AND PAULO OLIVA Abstract. We call proof mining the process of logically analyzing proofs in mathematics with the aim of obtaining new i

DocID: 1o5JD - View Document

Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008

Herbrand’s theorem and extractive proof theory U. Kohlenbach Department of Mathematics Technische Universit¨at Darmstadt Schlossgartenstrasse 7, 64289 Darmstadt, Germany September 1, 2008

DocID: 1nVyh - View Document