- sentential form
- сентенциальная форма (в формальных грамматиках) сентенциальная форма
Большой англо-русский и русско-английский словарь. 2001.
sentential form
Смотреть что такое "sentential form" в других словарях:
sentential calculus — /sɛnˌtɛnʃəl ˈkælkjələs/ (say sen.tenshuhl kalkyuhluhs) noun any symbolic systematic set of rules for joining or dividing sentences to form other sentences …
sentential connective — /sɛnˌtɛnʃəl kəˈnɛktɪv/ (say sen.tenshuhl kuh nektiv) noun a symbol, such as not , or , implies , used to combine two or more sentences to form a new sentence …
Laws of Form — (hereinafter LoF ) is a book by G. Spencer Brown, published in 1969, that straddles the boundary between mathematics and of philosophy. LoF describes three distinct logical systems: * The primary arithmetic (described in Chapter 4), whose models… … Wikipedia
statement form — noun or statement function : sentential function … Useful english dictionary
Deflationary theory of truth — A deflationary theory of truth is one of a family of theories which all have in common the claim that assertions that predicate truth of a statement do not attribute a property called truth to such a statement. Contents 1 Redundancy theory 2… … Wikipedia
Bottom-up parsing — (also known as shift reduce parsing) is a strategy for analyzing unknown data relationships that attempts to identify the most fundamental units first, and then to infer higher order structures from them. It attempts to build trees upward toward… … Wikipedia
Unrestricted grammar — In formal language theory, an unrestricted grammar is a formal grammar on which no restrictions are made on the left and right sides of the grammar s productions. This is the most general class of grammars in the Chomsky–Schützenberger hierarchy … Wikipedia
Operator-precedence grammar — An operator precedence grammar is a kind of grammar for formal languages. Technically, an operator precedence grammar is a context free grammar that has the property (among others[1]) that no production has either an empty right hand side or two… … Wikipedia
Left recursion — In computer science, left recursion is a special case of recursion. In terms of context free grammar, a non terminal r is left recursive if the left most symbol in any of r’s ‘alternatives’ either immediately (direct left recursive) or through… … Wikipedia
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
Linear bounded automaton — A linear bounded automaton (plural linear bounded automata, abbreviated LBA) is a restricted form of a non deterministic Turing machine. It possesses a tape made up of cells that can contain symbols from a finite alphabet, a head that can read… … Wikipedia
