tangency theorem - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

tangency theorem - перевод на русский

THEOREM
Lob's Theorem; Löb's Theorem; Lob's theorem; Loeb's theorem; Loeb theorem; Lob theorem; Löb theorem; Loeb's Theorem
Найдено результатов: 921
tangency theorem      
теорема касания
divergence theorem         
  • n}}
  • A volume divided into two subvolumes. At right the two subvolumes are separated to show the flux out of the different surfaces.
  • The volume can be divided into any number of subvolumes and the flux out of ''V'' is equal to the sum of the flux out of each subvolume, because the flux through the <span style="color:green;">green</span> surfaces cancels out in the sum. In (b) the volumes are shown separated slightly, illustrating that each green partition is part of the boundary of two adjacent volumes
  • </math> approaches <math>\operatorname{div} \mathbf{F}</math>
  • The divergence theorem can be used to calculate a flux through a [[closed surface]] that fully encloses a volume, like any of the surfaces on the left. It can ''not'' directly be used to calculate the flux through surfaces with boundaries, like those on the right. (Surfaces are blue, boundaries are red.)
  • The vector field corresponding to the example shown. Vectors may point into or out of the sphere.
GENERALIZATION OF THE FUNDAMENTAL THEOREM IN VECTOR CALCULUS
Gauss' theorem; Gauss's theorem; Gauss theorem; Ostrogradsky-Gauss theorem; Ostrogradsky's theorem; Gauss's Theorem; Divergence Theorem; Gauss' divergence theorem; Ostrogradsky theorem; Gauss-Ostrogradsky theorem; Gauss Ostrogradsky theorem; Gauss–Ostrogradsky theorem

математика

теорема о дивергенции

теорема Гаусса-Остроградского

formal theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem

математика

формальная теорема

theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem
theorem noun теорема Syn: see principle
logical theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem

математика

логическая теорема

theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem
theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem
theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem

['θiərəm]

общая лексика

теорема

существительное

['θiərəm]

общая лексика

теорема

синоним

principle

глагол

редкое выражение

выражать посредством или в форме теоремы

theorem         
  • planar]] map with five colors such that no two regions with the same color meet. It can actually be colored in this way with only four colors. The [[four color theorem]] states that such colorings are possible for any planar map, but every known proof involves a computational search that is too long to check by hand.
  • universality]]) resembles the [[Mandelbrot set]].
  • strings of symbols]] may be broadly divided into [[nonsense]] and [[well-formed formula]]s. A formal language can be thought of as identical to the set of its well-formed formulas. The set of well-formed formulas may be broadly divided into theorems and non-theorems.
IN MATHEMATICS, A STATEMENT THAT HAS BEEN PROVED
Theorems; Proposition (mathematics); Theorum; Mathematical theorem; Logical theorem; Formal theorem; Theorem (logic); Mathematical proposition; Hypothesis of a theorem
сущ.
положение, истинность которого устанавливается путем доказательств.

Определение

theorem
n.
Proposition (to be demonstrated), position, dictum, thesis.

Википедия

Löb's theorem

In mathematical logic, Löb's theorem states that in Peano arithmetic (PA) (or any formal system including PA), for any formula P, if it is provable in PA that "if P is provable in PA then P is true", then P is provable in PA. If Prov(P) means that the formula P is provable, we may express this more formally as

If
P A P r o v ( P ) P {\displaystyle PA\,\vdash \,{{\rm {Prov}}(P)\rightarrow P}}
then
P A P {\displaystyle PA\,\vdash \,P}

An immediate corollary (the contrapositive) of Löb's theorem is that, if P is not provable in PA, then "if P is provable in PA, then P is true" is not provable in PA. For example, "If 1 + 1 = 3 {\displaystyle 1+1=3} is provable in PA, then 1 + 1 = 3 {\displaystyle 1+1=3} " is not provable in PA.

Löb's theorem is named for Martin Hugo Löb, who formulated it in 1955. It is related to Curry's paradox.

Как переводится tangency theorem на Русский язык