A Well-Founded Set is a set in which every non-empty subset has a minimal element with respect to the membership relation, ensuring no infinite descending chains of elements exist.
36
Publications
3.1K
Citations
61
Authors
40
Institutions
Publications per year
2017–2026
0
Parents
Publications
36
The Iterative Conception of Set
George Boolos · The Journal of Philosophy · 1971 · 570 citations
Proving termination with multiset orderings
Nachum Dershowitz, Zohar Manna · Communications of the ACM · 1979 · 540 citations · Full text
Terminal coalgebras in well-founded set theory
Michael Barr · Theoretical Computer Science · 1993 · 269 citations
A Course in Constructive Algebra.
Michael J. Besson, Ray Mines, Fred Richman et al. · American Mathematical Monthly · 1990 · 188 citations
1–5 of 36
Authors
61
- DD
2
h-index
- BM
2
h-index
- MD
2
h-index
- ET
2
h-index
- EMEmerson Mitchell
1 publications · 21 citations
1
h-index
1–5 of 61
Institutions
40
KU Leuven
Leuven, Belgium
4 h-index
8 publications
284 citations
McGill University
Montreal, Canada
2 h-index
2 publications
297 citations
University of Toronto
Toronto, Canada
1 h-index
2 publications
38 citations
Universitat de Barcelona
Barcelona, Spain
1 h-index
1 publications
28 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
29 citations
Simon Fraser University
Burnaby, Canada
1 h-index
1 publications
109 citations
University of North Florida
Jacksonville, United States
1 h-index
1 publications
13 citations
American Mathematical Society
Providence, United States
1 h-index
1 publications
24 citations
1–8 of 40
Venues
- Theoretical Computer Science
3 publications · 308 citations
3
h-index
- Journal of Philosophical Logic
3 publications · 75 citations
3
h-index
- Philosophical Studies
2 publications · 158 citations
2
h-index
- Journal of Symbolic Logic
2 publications · 54 citations
2
h-index
- ACM Transactions on Computational Logic
TOCL · 2 publications · 138 citations
2
h-index
1–5