definability
See define.

* * *

Universalium. 2010.

### Look at other dictionaries:

• definability — index construction Burton s Legal Thesaurus. William C. Burton. 2006 …   Law dictionary

• definability — noun The quality of being definable. Ant: indefinability, undefinability …   Wiktionary

• definability — de·fin·abil·i·ty …   English syllables

• definability — də̇ˌfīnəˈbiləd.ē, dēˌ noun ( es) : the quality or state of being definable …   Useful english dictionary

• Beth definability — In mathematical logic, Beth definability states that for any two models A , B of a first order theory T in the language L ⊇ L, if A | L = B | L (where A | L is the reduct of A to L ) implies that for all tuples a of A , A ⊨ φ [ a ] if and only if …   Wikipedia

• Definable real number — A real number a is first order definable in the language of set theory, without parameters, if there is a formula φ in the language of set theory, with one free variable, such that a is the unique real number such that φ(a) holds in the standard… …   Wikipedia

• History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

• History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   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