Большой англо-русский и русско-английский словарь. 2001.
wellfounded — … Useful english dictionary
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Koenraad Elst — (born 7 August 1959) is a Belgian writer and orientalist (without institutional affiliation). He was an editor of the New Right Flemish nationalist journal Teksten, Kommentaren en Studies from 1992 to 1995, focusing on criticism of Islam, various … Wikipedia
Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… … Wikipedia
Jon Barwise — Kenneth Jon Barwise (June 29, 1942 March 5, 2000) was a U.S. mathematician, philosopher and logician who proposed some fundamental revisions to the way that logic is understood and used.Born in Independence, Missouri to Kenneth T. and Evelyn, he… … Wikipedia
Non-well-founded set theory — Non well founded set theories are variants of axiomatic set theory which allow sets to contain themselves and otherwise violate the rule of well foundedness. In non well founded set theories, the foundation axiom of ZFC is replaced by axioms… … Wikipedia
Corecursion — In computer science, corecursion is a type of operation that is dual to recursion. Corecursion and codata allow total languages to work with infinite data structures such as streams. Corecursion is often used in conjunction with lazy evaluation.… … Wikipedia
Prewellordering — In set theory, a prewellordering is a binary relation that is transitive, wellfounded, and total. In other words, if leq is a prewellordering on a set X, and if we define sim by:xsim yiff xleq y land yleq xthen sim is an equivalence relation on X … Wikipedia
Tree (descriptive set theory) — In descriptive set theory, a tree on a set X is a set of finite sequences of elements of X that is closed under subsequences. More formally, it is a subset T of X^{ … Wikipedia
Mouse (set theory) — In set theory, a mouse is a small model of (a fragment of) Zermelo Fraenkel set theory with desirable properties. The exact definition depends on the context. In most cases, there is a technical definition of premouse and an added condition of… … Wikipedia
Homogeneous tree — In descriptive set theory, a tree over a product set Y imes Z is said to be homogeneous if there is a system of measures langlemu smid sin{}^{ … Wikipedia
