- non-denumerably
- несчетно - non-denumerably infinite
Большой англо-русский и русско-английский словарь. 2001.
non-denumerably
Смотреть что такое "non-denumerably" в других словарях:
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
Many-worlds interpretation — The quantum mechanical Schrödinger s cat paradox according to the many worlds interpretation. In this interpretation every event is a branch point; the cat is both alive and dead, even before the box is opened, but the alive and dead cats are in… … Wikipedia
Cantor's first uncountability proof — Georg Cantor s first uncountability proof demonstrates that the set of all real numbers is uncountable. Cantor formulated the proof in December 1873 and published it in 1874 in Crelle s Journal [cite… … Wikipedia
Skolem paradox — Leopold Löwenheim (1878–1948) in 1915 and Thoralf Skolem (1887–1963) in 1920 showed that any denumerable set of sentences that has a model has a denumerably infinite model. The theory of real numbers can be axiomatized as a theory with a… … Philosophy dictionary
Mereologie — Méréologie Traduction à relire Mereology → … Wikipédia en Français
Méréologie — Traduction à relire Mereology → Méréologie … Wikipédia en Français
Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Russell's paradox — Part of the foundations of mathematics, Russell s paradox (also known as Russell s antinomy), discovered by Bertrand Russell in 1901, showed that the naive set theory of Frege leads to a contradiction.It might be assumed that, for any formal… … Wikipedia
Mereology — In philosophy and mathematical logic, mereology (from the Greek μέρος, root: μερε(σ) , part and the suffix logy study, discussion, science ) treats parts and the wholes they form. Whereas set theory is founded on the membership relation between a … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
