- finitely definable
- мат. конечно определимый
Большой англо-русский и русско-английский словарь. 2001.
finitely definable
Смотреть что такое "finitely definable" в других словарях:
Jules Richard — (born 12 Aug, 1862 in Blet, Département Cher, died 14 Oct, 1956 in Châteauroux, Département Indre) was a French mathematician. Life and WorksRichard taught at the lycées of Tours, Dijon and Châteauroux. He obtained his doctorate, at age of 39,… … Wikipedia
König's paradox — Also known as the Zermelo– König paradox. There are non denumerably many real numbers, but only denumerably many of them are finitely definable. Given Zermelo s proof that the reals can be well ordered, the set of reals that are not finitely… … Philosophy dictionary
Paradoxes of set theory — This article contains a discussion of paradoxes of set theory. As with most mathematical paradoxes, they generally reveal surprising and counter intuitive mathematical results, rather than actual logical contradictions within modern axiomatic set … Wikipedia
Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects … Wikipedia
Berry paradox — The Berry paradox is a self referential paradox arising from the expression the smallest possible integer not definable by a given number of words. Bertrand Russell, the first to discuss the paradox in print, attributed it to G. G. Berry, a… … Wikipedia
Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
Post's theorem — In computability theory Post s theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. Background The statement of Post s theorem requires several concepts relating to definability and… … Wikipedia
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
o-minimal theory — In mathematical logic, and more specifically in model theory, an infinite structure (M,<,...) which is totally ordered by < is called an o minimal structure if and only if every definable subset X ⊂ M (with parameters taken from… … Wikipedia
