non-enumerable set
11Constructive set theory — is an approach to mathematical constructivism following the program of axiomatic set theory. That is, it uses the usual first order language of classical set theory, and although of course the logic is constructive, there is no explicit use of… …
12Class (set theory) — In set theory and its applications throughout mathematics, a class is a collection of sets (or sometimes other mathematical objects) which can be unambiguously defined by a property that all its members share. The precise definition of class… …
13Uncountable set — Uncountable redirects here. For the linguistic concept, see Uncountable noun. In mathematics, an uncountable set is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal… …
14List of set theory topics — Logic portal Set theory portal …
15Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment …
16denumerable/non-denumerable — A denumerable set is one whose cardinality is that of the natural numbers. A set is non denumerable if it is of greater cardinality than this. Cantor s theorem proves the existence of such sets. A finite set is of lesser cardinality than the… …
17LOGIQUES NON CLASSIQUES — La logique formelle «classique» (cf. histoire de la LOGIQUE, LOGIQUE MATHÉMATIQUE, théorie de la DÉMONSTRATION) est une théorie de l’inférence valide qui ne prend pas en considération le contenu sémantique de l’argument. Elle est une logique… …
18Index set (recursion theory) — In the field of recursion theory, index sets describe classes of partial recursive functions, specifically they give all indices of functions in that class according to a fixed enumeration of partial recursive functions (a Gödel… …
19Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown …
20Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… …
