Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Gerhardy, Philipp; Kohlenbach, Ulrich License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-4318
URL:

;

Generalized metatheorems on the extractability of uniform bounds in functional analysis

pdf-format:


Abstract

Recently U.Kohlenbach proved general metatheorems for the extraction of (uniform) bounds from classical
proofs in functional analysis. The proof was based on
a combination of Gödel's functional interpretation
and Bezem's strong majorization relation. We present
a generalization of the majorization relation which
allows to generalize Kohlenbach's metatheorems
significantly. Finally, we will discuss some examples
which are now covered by the new metatheorems.

BibTeX - Entry

@InProceedings{gerhardy_et_al:DagSemProc.05021.13,
  author =	{Gerhardy, Philipp and Kohlenbach, Ulrich},
  title =	{{Generalized metatheorems on the extractability of uniform bounds in functional analysis}},
  booktitle =	{Mathematics, Algorithms, Proofs},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5021},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/431},
  URN =		{urn:nbn:de:0030-drops-4318},
  doi =		{10.4230/DagSemProc.05021.13},
  annote =	{Keywords: Proof mining, majorization}
}

Keywords: Proof mining, majorization
Seminar: 05021 - Mathematics, Algorithms, Proofs
Issue date: 2006
Date of publication: 17.01.2006


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI