- unbounded quantifier
- мат. неограниченный квантор
Большой англо-русский и русско-английский словарь. 2001.
unbounded quantifier
Смотреть что такое "unbounded quantifier" в других словарях:
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
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Real closed field — In mathematics, a real closed field is a field F in which any of the following equivalent conditions are true:#There is a total order on F making it an ordered field such that, in this ordering, every positive element of F is a square in F and… … Wikipedia
Μ-recursive function — In mathematical logic and computer science, the μ recursive functions are a class of partial functions from natural numbers to natural numbers which are computable in an intuitive sense. In fact, in computability theory it is shown that the μ… … Wikipedia
Begging the question — Bust of Aristotle, whose Prior Analytics contained an early discussion of this fallacy. Begging the question (or petitio principii, assuming the initial point ) is a type of logical fallacy in which the proposition to be proven is assumed… … Wikipedia
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists … Wikipedia
