-
1 арифметически определимое множество
Русско-английский научно-технический словарь Масловского > арифметически определимое множество
-
2 арифметически определимый
Русско-английский научно-технический словарь Масловского > арифметически определимый
-
3 арифметически определимое множество
Mathematics: arithmetically definable setУниверсальный русско-английский словарь > арифметически определимое множество
-
4 арифметически определимый
Mathematics: arithmetically definableУниверсальный русско-английский словарь > арифметически определимый
См. также в других словарях:
Arithmetical set — In mathematical logic, an arithmetical set (or arithmetic set) is a set of natural numbers that can be defined by a formula of first order Peano arithmetic. The arithmetical sets are classified by the arithmetical hierarchy.A function f:subseteq… … Wikipedia
Arithmetical hierarchy — In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The… … Wikipedia
Hyperarithmetical theory — In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an… … Wikipedia
Tarski's undefinability theorem — Tarski s undefinability theorem, stated and proved by Alfred Tarski in 1936, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that arithmetical truth… … Wikipedia
Borel hierarchy — In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number… … Wikipedia
Theodore Slaman — Theodore Allen Slaman is a professor of mathematics at the University of California, Berkeley who works in recursion theory. Slaman and W. Hugh Woodin formulated the Bi interpretability Conjecture for the Turing degrees, which conjectures that… … 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
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
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
Forcing (recursion theory) — Forcing in recursion theory is a modification of Paul Cohen s original set theoretic technique of forcing to deal with the effective concerns in recursion theory. Conceptually the two techniques are quite similar, in both one attempts to build… … Wikipedia