- quantified variable
- переменная под знаком квантора, квантифицируемая переменная
Большой англо-русский и русско-английский словарь. 2001.
quantified variable
Смотреть что такое "quantified variable" в других словарях:
True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… … Wikipedia
Predicate variable — In first order logic, a predicate variable is a predicate letter which can stand for a relation (between terms) but which has not been specifically assigned any particular relation (or meaning). In first order logic (FOL) they can be more… … Wikipedia
bound variable — A variable x is bound in a formula if it is within the scope of a quantifier (in first order logic, (∀x ) or (∃x )). Intuitively this means that as the formula is evaluated and x in this occurrence is assigned to an object, the quantified… … Philosophy dictionary
schematic variable — noun A variable that appears in an axiom schema and ranges over formulas, distiguished from the variables of the axiom schema that are quantified over and that range over the individuals of the universe of discourse … Wiktionary
Quantification — has two distinct meanings.In mathematics and empirical science, it refers to human acts, known as counting and measuring that map human sense observations and experiences into members of some set of numbers. Quantification in this sense is… … Wikipedia
Statement (logic) — In the area of mathematics called symbolic logic a statement is a declarative sentence that is either true or false.Examples of statements:* Socrates is a man. * A triangle has three sides. * Paris is the capital of England. The first two… … Wikipedia
Alternating Turing machine — In computational complexity theory, an alternating Turing machine (ATM) is a non deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co NP.… … Wikipedia
Skolem normal form — A formula of first order logic is in Skolem normal form (named after Thoralf Skolem) if it is in conjunctive prenex normal form with only universal first order quantifiers. Every first order formula can be converted into Skolem normal form while… … Wikipedia
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
quantification — See quantifiable. * * * ▪ logic in logic, the attachment of signs of quantity to the predicate or subject of a proposition. The universal quantifier, symbolized by (∀ ) or ( ), where the blank is filled by a variable, is used to express… … Universalium
Mereology — In philosophy and mathematical logic, mereology (from the Greek μέρος, root: μερε(σ) , part and the suffix logy study, discussion, science ) treats parts and the wholes they form. Whereas set theory is founded on the membership relation between a … Wikipedia
