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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

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

Variations of Rado's lemma.Paul Howard - 1993 - Mathematical Logic Quarterly 39 (1):353-356.
The weak König lemma and uniform continuity.Josef Berger - 2008 - Journal of Symbolic Logic 73 (3):933-939.
Effective Borel degrees of some topological functions.Guido Gherardi - 2006 - Mathematical Logic Quarterly 52 (6):625-642.
λμ-calculus and Böhm's theorem.René David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
Über die Variationsrechnung in Hilberts Werken zur Analysis.Rüdiger Thiele - 1997 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 5 (1):23-42.
Quantum logical calculi and lattice structures.E. -W. Stachow - 1978 - Journal of Philosophical Logic 7 (1):347 - 386.
$lambdamu$-Calculus and Bohm's Theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
An interpolation lemma for the pure implicational calculus.Roy Edelstein - 1975 - Journal of Symbolic Logic 40 (3):443-444.

Analytics

Added to PP
2014-01-16

Downloads
19 (#682,951)

6 months
5 (#246,492)

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 Analysis.R. L. Goodstein - 1971 - Journal of Symbolic Logic 36 (1):148-150.
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