- In mathematics, a
binary relation R is
called well-founded (or
wellfounded or foundational) on a set or, more generally, a
class X if
every non-empty...
-
formal logic,
wellfoundedness prohibits ⋯ < x < ⋯ < x < ⋯ {\displaystyle \cdots <x<\cdots <x<\cdots } for any x. Thus non-
wellfounded mereology treats...
- Moss,
Lawrence S. (1996),
Vicious circles. On the
mathematics of non-
wellfounded phenomena, CSLI
Lecture Notes, vol. 60, CSLI Publications, ISBN 1-57586-009-0...
- K. J. & Moss, L. (1996)
Vicious Circles. On the
Mathematics of Non-
Wellfounded Phenomena ISBN 1-57586-008-2 Barwise, K, J. & Seligman, J. (1997) Information...
- Moss,
Lawrence S. (1996),
Vicious circles. On the
mathematics of non-
wellfounded phenomena, CSLI
Lecture Notes, vol. 60, CSLI Publications, p. 306, ISBN 1575860090...
- and an
added condition of
iterability (referring to the
existence of
wellfounded iterated ultrapowers): a
mouse is then an
iterable premouse. The notion...
-
system that
includes an
axiom ****erting that the
ordinal called ε0 is
wellfounded; see Gentzen's
consistency proof. Gentzen's
theorem spurred the development...
- ISSN 1572-8420. COTNOIR,
AARON J.; BACON,
ANDREW (2011-12-09). "Non-
Wellfounded Mereology". The
Review of
Symbolic Logic. 5 (2): 187–204. doi:10.1017/s1755020311000293...
- Ahrens, Benedikt; Capriotti, Paolo; Spadotti, Régis (2015-04-12). Non-
wellfounded trees in
Homotopy Type Theory.
Leibniz International Proceedings in Informatics...
- κ-model M for
which there exists an M-ultrafilter on κ
which allows for
wellfounded iterations by
ultrapowers of
arbitrary length.
Gitman gave a
finer notion...
