- relative constructibility
- мат. относительная конструктивность
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Zero sharp — In the mathematical discipline of set theory, 0# (zero sharp, also 0#) is defined to be a particular real number satisfying certain conditions, namely, to be the real number that codes in the canonical way the Gödel numbers of the true formulas… … Wikipedia
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Turing reduction — In computability theory, a Turing reduction from a problem A to a problem B, named after Alan Turing, is a reduction which solves A, assuming B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to … Wikipedia
Computability 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 … Wikipedia
Recursion 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… … Wikipedia
Continuum hypothesis — This article is about the hypothesis in set theory. For the assumption in fluid mechanics, see Fluid mechanics. In mathematics, the continuum hypothesis (abbreviated CH) is a hypothesis, advanced by Georg Cantor in 1877[citation needed], about… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
Universe (mathematics) — In mathematical logic, the universe of a structure (or model ) is its domain.In mathematics, and particularly in applications to set theory and the foundations of mathematics, a universe or universal class (or if a set, universal set – not to be… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium