completeness

  • 31rule of completeness — rule of com·plete·ness: a rule permitting a party to require introduction of the rest of or more of a document or recorded statement that is being used as evidence by the opposing party ◇ The rule of completeness applies when fairness demands… …

    Law dictionary

  • 32essential to completeness — index integral Burton s Legal Thesaurus. William C. Burton. 2006 …

    Law dictionary

  • 33absolute completeness — visiškasis baigtumas statusas T sritis radioelektronika atitikmenys: angl. absolute completeness vok. absolute Vollständigkeit, f rus. абсолютная завершённость, f pranc. complétude absolue, f …

    Radioelektronikos terminų žodynas

  • 34functional completeness — funkcinis baigtumas statusas T sritis radioelektronika atitikmenys: angl. functional completeness vok. funktionnelle Vollständigkeit, f rus. функциональная завершённость, f pranc. complétude fonctionnelle, f …

    Radioelektronikos terminų žodynas

  • 35проверка полноты ( completeness check) — 3.1.1 проверка полноты ( completeness check): Процесс верификации достаточности информации, получаемой на предшествующих фазах ОЖЦ или ИАЖЦ, для формирования заключений в соответствии с определением цели и области исследования. Источник: ГОСТ Р… …

    Словарь-справочник терминов нормативно-технической документации

  • 36NP-completeness — noun The state or condition of being NP complete …

    Wiktionary

  • 37metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …

    Universalium

  • 38Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… …

    Wikipedia

  • 39NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… …

    Wikipedia

  • 40mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… …

    Universalium