![Computability theory / Proof theory / Mathematical logic / Predicate logic / Logic in computer science / Primitive recursive functional / Reverse mathematics / Primitive recursive function / Primitive recursive arithmetic / First-order logic / Peano axioms / Ordinal analysis Computability theory / Proof theory / Mathematical logic / Predicate logic / Logic in computer science / Primitive recursive functional / Reverse mathematics / Primitive recursive function / Primitive recursive arithmetic / First-order logic / Peano axioms / Ordinal analysis](https://www.pdfsearch.io/img/2ff5e004b1340ae2495d25f4380e5b33.jpg) Date: 2012-11-16 09:11:16Computability theory Proof theory Mathematical logic Predicate logic Logic in computer science Primitive recursive functional Reverse mathematics Primitive recursive function Primitive recursive arithmetic First-order logic Peano axioms Ordinal analysis | | On uniform weak K¨onig’s lemma Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Ny MunkegadeAdd to Reading ListSource URL: www.mathematik.tu-darmstadt.deDownload Document from Source Website File Size: 156,78 KBShare Document on Facebook
|