# sentential operator

﻿
sentential operator
Any operator that takes a sentence as its argument, usually to deliver another sentence.

Philosophy dictionary. . 2011.

### Look at other dictionaries:

• 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

• Leibniz operator — One of the cornerstone concepts in the theory of abstract algebraic logic is that of the Leibniz operator.MotivationThe Leibniz operator was introduced by Willem Blok and Don Pigozzi, two of the founders of the field, as a means to abstract the… …   Wikipedia

• Donald Davidson (philosopher) — Donald Herbert Davidson Portrait of Donald Davidson by the photographer Steve Pyke in 1990. Full name Donald Herbert Davidson Born 6 March 1917(1917 03 06) Springfield, Massachusetts …   Wikipedia

• 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

• Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia

• Propositional formula — In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional… …   Wikipedia

• Polish notation — Polish notation, also known as prefix notation, is a form of notation for logic, arithmetic, and algebra. Its distinguishing feature is that it places operators to the left of their operands. If the arity of the operators is fixed, the result is… …   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

• SKI combinator calculus — is a computational system that is a reduced, untyped version of Lambda calculus. All operations in Lambda calculus are expressed in SKI as binary trees whose leaves are one of the three symbols S, K, and I (called combinators). In fact, the… …   Wikipedia