## On Equivalents of Well-Foundedness

- Piotr Rudnicki, Andrzej Trybulec
- Journal of Automated Reasoning
- 1999

2 Excerpts

- Published 1989

The articles [6], [3], [8], [9], [1], [2], [7], and [5] provide the notation and terminology for this paper. The following two propositions are true: (10)1 For all sets X , x and for every function F from [:X , X :] into X such that x ∈ [:X , X :] holds F(x) ∈ X . (11) Let X be a set and F be a binary operation on X . Then there exists a subset A of X such that for every set x such that x ∈ [:A, A :] holds F(x) ∈ A.

@inproceedings{Biaas1989GroupAF,
title={Group and Field Definitions},
author={J{\'o}zef Białas},
year={1989}
}