#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1999

2012

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Nach einer kurzen Einleitung (3 1) wird in § 2 untersucht, welchen Bedingungen die Lagrangesche Funktion fi eines Systems von Feldern geniigen muss, damit Dichte und Strom der elektrischen Ladung oder ahnlicher Grossen (wie z.B. die Dichte schwerer Teilchen) einer Kontinuitatsgleichung Geniige leisten. In diesem Zusammenhang wird das Postulat der… (More)

- Johan G. F. Belinfante
- Journal of Automated Reasoning
- 1999

Some basic theorems about composition and other key constructs of set theory were proved using McCune’s computer program OTTER, building on Quaife’s modification of Gödel’s class theory. Our proofs use equational definitions in terms of Gödel’s flip and rotate functors. A new way to prove the composition of homomorphisms theorem is also presented.

- Johan G. F. Belinfante
- Journal of Automated Reasoning
- 1999

Some basic theorems about ordinal numbers were proved using McCune’s computer program OTTER, building on Quaife’s modification of Gödel’s class theory. Our theorems are based on Isbell’s elegant definition of ordinals. Neither the axiom of regularity nor the axiom of choice is used.

- Johan G. F. Belinfante
- CADE
- 2000

- Johan G. F. Belinfante
- CADE
- 2003

A computer implementation of Gödel’s algorithm for class formation in Mathematica 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 McCune’s automated reasoning program Otter. The applications include the theory… (More)

- Johan G. F. Belinfante
- Journal of Automated Reasoning
- 2012

The GOEDEL program is an ever-growing collection of currently more than thirty thousand rewrite rules for transforming expressions in Gödel’s class theory in the hope of thereby simplifying them. A brief survey of the program and its use is presented. A few striking results obtained recently using the program are featured to provide some of the flavor of… (More)

- Johan G. F. Belinfante
- J. Symb. Comput.
- 2003

definition Definition. The class of all bands is defined by a class-wrapped membership rule. In[2]:= class@t_, member@x_, BANDSDD := ReleaseHold@Module@8u = Unique@D<, class@t, and@member@x, HoldPattern@SEMIGPSDD, forall@u, implies@member@u, fix@domain@xDDD, member@pair@pair@u, uD, uD, xDDDDDDD The DownValues of class need to be sorted to put this rule… (More)

- Johan G. F. Belinfante, Tiffany D. Goble

The GOEDEL program, a computer implementation of Gödel’s algorithm for class formation in Mathematica 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 focus… (More)