constructive function
21Sergei Natanovich Bernstein — Infobox Scientist name = Sergei Natanovich Bernstein image width = 300px caption = Sergei Natanovich Bernstein birth date = birth date|1880|3|5|df=y birth place = Odessa, Imperial Russia death date = death date and age|1968|10|26|1880|3|5|df=y… …
22Nikolai Alexandrowitsch Schanin — (russisch Николай Александрович Шанин; englische Transkription Nicolai Aleksandrovich Shanin; * 26. Mai 1919 in Pskow) ist ein russischer Mathematiker, der sich mit Topologie und mathematischer Logik beschäftigt. Schanin studierte in… …
23Naum Ilyich Akhiezer — ( ru. Наум Ильич Ахиезер) (6 March, 1901, Cherikov, Belarus – 3 June, 1980, Kharkov, USSR) was a mathematician of Jewish origin, known for his works in constructive function theory, approximation theory, the problem of moments, operator theory… …
24конструктивная функция — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN constructive function …
25Constructivism (mathematics) — In the philosophy of mathematics, constructivism asserts that it is necessary to find (or construct ) a mathematical object to prove that it exists. When one assumes that an object does not exist and derives a contradiction from that assumption,… …
26analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… …
27Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… …
28List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …
29Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… …
30König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… …
