#### Filter Results:

- Full text PDF available (7)

#### Publication Year

1999

2012

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn 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

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)

- Johan G. F. Belinfante
- CADE
- 2003

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)

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

In troduct ion Lie algebras were invented to simpJ-ify calculations with r i a arnrrnc :nd thoi r ranra<an{-:f i nnq Tha fha^rv of T.i c al oe-!r s Y r vqt/r qr.u errsrr r LlJ! e bras has consequently always been constructively oriented. ^riain:l1rr:1r ardorithms had to be carried out by hand, which fortunately provided a strong incentive to develop… (More)

- JOHAN G. F. BELINFANTE, W. Ki11ing
- 2012

summary A band is a semigroup whose elements are all idempotent. (Another name for a band is an idempotent semigroup.) This notebook introduces the definition of the class BANDS of all bands, and derives a few immediate consequences of the definition. definition Definition. The class of all bands is defined by a class-wrapped membership rule. The DownValues… (More)

summary This third notebook on well−founded recursion is concerned with restrictions of partial solutions. It may be recalled that to avoid automatic expansion of its (fairly complicated) definition, the class partrec[x,y] of partial solutions had been defined by a membership rule wrapped with class. It was later shown in the notebook partrec.nb that an… (More)