Predicate functor logic
Algebraization of first-order logic / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Predicate functor logic?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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)[1] that operate on terms to yield terms. PFL is mostly the invention of the logician and philosopher Willard Quine.