Effective content of the calculus of variations I: Semi-continuity and the chattering lemma

Annals of Pure and Applied Logic 78 (1-3):127-146 (1996)
  Copy   BIBTEX

Abstract

The content of existence theorems in the calculus of variations has been explored and an effective treatment of semi-continuity has been achieved. An algorithm has been developed which captures the natural algorithmic content of the notion of a semi-continuous function and this is used to obtain an effective version of the “chattering lemma” of control theory and ordinary differential equations. This lemma reveals the main computational content of the theory of relaxed optimal control

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Categories and functors in reverse and computable mathematics.Huishan Wu - forthcoming - Archive for Mathematical Logic:1-31.
The weak König lemma and uniform continuity.Josef Berger - 2008 - Journal of Symbolic Logic 73 (3):933-939.
On the Hamkins approximation property.William J. Mitchell - 2006 - Annals of Pure and Applied Logic 144 (1-3):126-129.
λμ-calculus and Böhm's theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
Bounded functional interpretation and feasible analysis.Fernando Ferreira & Paulo Oliva - 2007 - Annals of Pure and Applied Logic 145 (2):115-129.
On the diagonal lemma of Gödel and Carnap.Saeed Salehi - 2020 - Bulletin of Symbolic Logic 26 (1):80-88.
On Farkas' lemma and related propositions in BISH.Josef Berger & Gregor Svindland - 2022 - Annals of Pure and Applied Logic 173 (2):103059.

Analytics

Added to PP
2014-01-16

Downloads
33 (#689,874)

6 months
2 (#1,689,990)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.

Add more citations

References found in this work

Nicht konstruktiv beweisbare sätze der analysis.Ernst Specker - 1949 - Journal of Symbolic Logic 14 (3):145-158.
Computable Functionals.A. Grzegorczyk - 1959 - Journal of Symbolic Logic 24 (1):50-51.
Recursive Metric Spaces.Y. N. Moschovakis - 1966 - Journal of Symbolic Logic 31 (4):651-652.

Add more references