- derivability
- (логика) выводимость (математика) дифференцируемость
Большой англо-русский и русско-английский словарь. 2001.
derivability
Смотреть что такое "derivability" в других словарях:
derivability — noun The condition of being derivable … Wiktionary
derivability — de·riv·abil·i·ty … English syllables
derivability — də̇ˌrīvəˈbiləd.ē, dēˌ noun : the quality or state of being derivable … Useful english dictionary
Rule of inference — In logic, a rule of inference (also called a transformation rule) is a function from sets of formulae to formulae. The argument is called the premise set (or simply premises ) and the value the conclusion . They can also be viewed as relations… … Wikipedia
Metalogic — is the study of the metatheory of logic. While logic is the study of the manner in which logical systems can be used to decide the correctness of arguments, metalogic studies the properties of the logical systems themselves.[1] According to… … Wikipedia
Formal interpretation — A formal interpretation [http://books.google.com/books?id=weKqT3ka5g0C pg=PA74 lpg=PA74 dq=%22Formal+interpretation%22+%22formal+language%22 source=web ots=pLN ms7Wi2 sig=P JqwdzOqLcX4nMpP64qmacnkDU hl=en#PPA74,M1 Cann Ronnie, Formal Semantics:… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
Hilbert-style deduction system — In logic, especially mathematical logic, a Hilbert style deduction system is a type of system of formal deduction attributed to Gottlob FregeMáté Ruzsa 1997:129] and David Hilbert. These deductive systems are most often studied for first order… … Wikipedia
Judgment (mathematical logic) — In mathematical logic, a judgment can be for example an assertion about occurrence of a free variable in an expression of the object language, or about provability of a proposition (either as a tautology or from a given context); but judgments… … Wikipedia
Relational model — The relational model for database management is a database model based on first order predicate logic, first formulated and proposed in 1969 by Edgar Codd. [ Derivability, Redundancy, and Consistency of Relations Stored in Large Data Banks , E.F … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
