Predicate Functor Logic
In mathematical logic, predicate functor logic (PFL) is one of several ways to express first-order logic (also known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic devices called predicate functors (or predicate modifiers) that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine.
Read more about Predicate Functor Logic: Motivation, Kuhn's Formalization, Bacon's Work, From First-order Logic To PFL, See Also
Famous quotes containing the words predicate and/or logic:
“The only thing that one really knows about human nature is that it changes. Change is the one quality we can predicate of it. The systems that fail are those that rely on the permanency of human nature, and not on its growth and development. The error of Louis XIV was that he thought human nature would always be the same. The result of his error was the French Revolution. It was an admirable result.”
—Oscar Wilde (1854–1900)
“Neither Aristotelian nor Russellian rules give the exact logic of any expression of ordinary language; for ordinary language has no exact logic.”
—Sir Peter Frederick Strawson (b. 1919)