quantifier-free

См. также в других словарях:

• Quantifier elimination — is a technique in mathematical logic, model theory, and theoretical computer science.We say that a given theory has quantifier elimination if for every sentence with quantification there exists an equivalent (modulo the theory) sentence without… …   Wikipedia

• quantifier — Informally, a quantifier is an expression that reports a quantity of times that a predicate is satisfied in some class of things (i.e. in a ‘domain’). Thus, thinking about a class of children and their diets, one might report that some eat cake,… …   Philosophy dictionary

• free — [[t]fri[/t]] adj. fre•er, fre•est, 1) gov enjoying personal rights or liberty, as one who is not in slavery or confinement 2) gov pertaining to or reserved for those who enjoy personal liberty: living on free soil[/ex] 3) gov existing under,… …   From formal English to slang

• free variable — Logic. (in functional calculus) a variable occurring in a sentential function and not within the scope of any quantifier containing it. Cf. bound variable. * * * …   Universalium

• free variable — A variable not bound by a quantifier …   Philosophy dictionary

• free variable — noun : a variable whose range is not restricted by quantification * * * Logic. (in functional calculus) a variable occurring in a sentential function and not within the scope of any quantifier containing it. Cf. bound variable …   Useful english dictionary

• Bounded quantifier — In the study of formal theories in mathematical logic, bounded quantifiers are often added to a language. These are two quantifiers in addition to forall and exists. They are motivated by the fact that determining whether a sentence with only… …   Wikipedia

• Lindström quantifier — In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. They are a generalization of first order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers.They were… …   Wikipedia

• Conditional quantifier — In logic, a conditional quantifier is a kind of Lindström quantifier (or generalized quantifier) QA that, relative to a classical model A, satisfies some or all of the following conditions ( X and Y range over arbitrary formulas in one free… …   Wikipedia

• Whitehead's point-free geometry — In mathematics, point free geometry is a geometry whose primitive ontological notion is region rather than point. Two axiomatic systems are set out below, one grounded in mereology, the other in mereotopology and known as connection theory… …   Wikipedia

• Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… …   Wikipedia