- logical completeness
- мат. логическая полнота
Большой англо-русский и русско-английский словарь. 2001.
logical completeness
Смотреть что такое "logical completeness" в других словарях:
Completeness — In general, an object is complete if nothing needs to be added to it. This notion is made more specific in various fields. Contents 1 Logical completeness 2 Mathematical completeness 3 Computing 4 … Wikipedia
Logical positivism — (also known as logical empiricism, scientific philosophy, and neo positivism) is a philosophy that combines empiricism the idea that observational evidence is indispensable for knowledge with a version of rationalism incorporating mathematical… … Wikipedia
Logical truth — is one of the most fundamental concepts in logic, and there are different theories on its nature. A logical truth is a statement which is true and remains true under all reinterpretations of its components other than its logical constants. It is… … Wikipedia
Logical connective — This article is about connectives in classical logic. For connectors in natural languages, see discourse connective. For connectives and operators in other logics, see logical constant. For other logical symbols, see table of logic symbols. In… … Wikipedia
Logical NOR — This article is about NOR in the logical sense. For the electronic gate, see NOR gate. For other uses, see Nor. Venn diagram of In boolean logic, logical nor or joint denial is a truth functional operator which produces a result that is the… … Wikipedia
completeness — Intuitively, a logical system is complete if everything that we want can be derived in it. Thus a formalization of logic is complete if all logically valid forms of argument are derivable in the system; a system designed to codify mathematical… … Philosophy dictionary
Completeness (knowledge bases) — A knowledge base KB is complete if there is no formular α such that KB ⊭ α and KB ⊭ ¬α. Example of knowledge base with incomplete knowledge: KB := { A ∨ B } Then we have KB ⊭ A and KB ⊭ ¬A. In some cases, you can make a consistent knowledge… … Wikipedia
completeness — noun 1. the state of being complete and entire; having everything that is needed (Freq. 2) • Ant: ↑incompleteness • Derivationally related forms: ↑complete • Hypernyms: ↑integrity, ↑unity, ↑ … Useful english dictionary
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Functional completeness — In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.[1][2] A well known complete set of… … Wikipedia
Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… … Wikipedia
