- existential formula
- мат. экзистенциальная формула
Большой англо-русский и русско-английский словарь. 2001.
existential formula
Смотреть что такое "existential formula" в других словарях:
Formula (mathematical logic) — In mathematical logic, a formula is a type of abstract object a token of which is a symbol or string of symbols which may be interpreted as any meaningful unit (i.e. a name, an adjective, a proposition, a phrase, a string of names, a string of… … Wikipedia
Existential quantification — In predicate logic, an existential quantification is the predication [The term predication in grammar means the predicate of a sentence which refers to subject and is an adverb or adjective, or equivalent, that describes an attribute of the… … Wikipedia
Existential graph — An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote his first paper on graphical logic in 1882 and continued to develop the method until his death in 1914.The… … Wikipedia
Formula game — A formula game is an artificial game represented by a fully quantified Boolean formula. Players turns alternate and the space of possible moves is denoted by bound variables. If a variable is universally quantified, the formula following it has… … Wikipedia
existential operator — noun a logical quantifier of a proposition that asserts the existence of at least one thing for which the proposition is true • Syn: ↑existential quantifier • Hypernyms: ↑quantifier, ↑logical quantifier * * * noun or existentia … Useful english dictionary
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
Truth-value semantics — In formal semantics, truth value semantics is an alternative to Tarskian semantics. It has been primarily championed by Ruth Barcan Marcus, H. Leblanc, and M. Dunn and N. Belnap. It is also called the substitution interpretation (of the… … Wikipedia
Skolem hull — A Skolem hull is a construction from mathematical logic. Given a structure S (with some set of properties and relations) the Skolem hull of S is the smallest elementary substructure of S . More precisely, for any existential formula (without… … Wikipedia
Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized … Wikipedia
Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… … Wikipedia
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
