Zusammenfassung Nach einer kurzen Einleitung (3 1) wird in § 2 untersucht, welchen Be-dingungen die Lagrangesche Funktion fi eines Systems von Feldern ge-niigen muss, damit Dichte und Strom der elektrischen Ladung oder ahnli-cher Grossen (wie z.B. die Dichte schwerer Teilchen) einer Kontinuitats-gleichung Geniige leisten. In diesem Zusammenhang wird das… (More)
A computer implementation of Gödel's algorithm for class formation in Mathematica TM was used to formulate definitions and theorems about iteration in Gödel's class theory. The intent is to use this approach for automated reasoning about a variety of applications of iteration using Mc-Cune's automated reasoning program Otter. The applications include the… (More)
The GOEDEL program, a computer implementation of Gödel's algorithm for class formation in Mathematica TM was used for formulating definitions and discovering theorems about topology and its generalizations, working within Gödel's class theory. A general characterization of CORE[x] and HULL[x] functions discovered in the course of this work is the primary… (More)
In the study of problems of disturbance localization, output zeroing, decoupling by state and ouEpuL feedback of linear dynamical sysLems wjth sysLem matrix A and ouEput matrix B, Lhe (A,B)-invariant and (A,B)-controllability sub-spaces of the state space play an imporLanL roLe. It is shown that the partlally ordered sets of all (A,B)-invariant subspaces… (More)
This paper describes using Forth as a metalanguage to construct a tiny, but extensible, functional programming language S/K/ID. In this type-free language both programs and data are combinators.