- quantifier-free calculus
- мат. бескванторное исчисление
Большой англо-русский и русско-английский словарь. 2001.
quantifier-free calculus
Смотреть что такое "quantifier-free calculus" в других словарях:
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 — 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
Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as … Wikipedia
Tuple relational calculus — The tuple calculus is a calculus that was introduced by Edgar F. Codd as part of the relational model in order to give a declarative database query language for this data model. It formed the inspiration for the database query languages QUEL and… … 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
Model 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
Herbrand's theorem — is a fundamental result of mathematical logic obtained by Jacques Herbrand (1930). [J. Herbrand: Recherches sur la theorie de la demonstration. Travaux de la Societe des Sciences et des Lettres de Varsovie, Class III, Sciences Mathematiques et… … Wikipedia
Primitive recursive arithmetic — Primitive recursive arithmetic, or PRA, is a quantifier free formalization of the natural numbers. It was first proposed by Skolem [Thoralf Skolem (1923) The foundations of elementary arithmetic in Jean van Heijenoort, translator and ed. (1967)… … Wikipedia
Prenex normal form — A formula of the predicate calculus is in prenex[1] normal form if it is written as a string of quantifiers followed by a quantifier free part (referred to as the matrix). Every formula in classical logic is equivalent to a formula in prenex… … Wikipedia
(ε, δ)-definition of limit — In calculus, the 19th century German mathematician Karl Weierstrass formulated the (ε, δ) definition of limit ( epsilon delta definition of limit ). Informal statement Let fnof; be a function. To say that: lim {x o c}f(x) = L , means that fnof; ( … Wikipedia
