Monadic predicate calculus

From Wikipedia, the free encyclopedia

In logic, the monadic predicate calculus is the fragment of predicate calculus in which all predicate letters are monadic (that is, they take only one argument), and there are no function letters. All atomic formulae have the form P(x), where P is a predicate letter and x is a variable.

Adding a single binary predicate letter to monadic logic would result in a system with the expressive power of the full predicate calculus. Therefore the absence of polyadic predicates severely restricts what can be expressed in the monadic predicate calculus. That calculus is so weak that, unlike the full predicate calculus, it is decidable whether a given formula of that calculus is logically valid (true for all nonempty domains).[1] Because the monadic predicate calculus is decidable, it is ipso facto inadequate for general mathematical reasoning, if only because the tiny fragment of mathematics called Peano arithmetic is known to be undecidable.

Notwithstanding the above deficiencies, the need to go beyond monadic logic was not appreciated until the work on the logic of relations, by Augustus DeMorgan and Charles Peirce in the 19th century, and by Frege in his little-read 1879 Begriffsschrifft. Prior to the work of these three men, syllogistic term logic was widely considered adequate for formal deductive reasoning.

Inferences in term logic can all be represented in the monadic predicate calculus. For example the syllogism

All dogs are mammals
No mammal is a herbivore
Thus, no dog is a herbivore

can be notated in the language of monadic predicate calculus as

(\forall x\,D(x)\Rightarrow M(x))\land \neg(\exists y\,M(y)\land H(y)) \Rightarrow \neg(\exists z\,D(z)\land H(z))

where D, M and H denote the predicates of being, respectively, a dog, a mammal, and a herbivore.

Conversely, monadic predicate calculus is not significantly more expressive than term logic. It is easily proved that every formula in the monadic predicate calculus is equivalent to a formula in which quantifiers appear only in closed subformulae of the form

\forall x\,P_1(x)\lor\cdots\lor P_n(x)\lor\neg P'_1(x)\lor\cdots\lor \neg P'_m(x)

or

\exists x\,\neg P_1(x)\land\cdots\land\neg P_n(x)\land P'_1(x)\land\cdots\land P'_m(x),

Each of these formulas is the negation of the other, and the quantifiers do not nest. These formulas also generalize slightly the form of basic judgements considered in term logic. For example, this form allows statements such as "Every mammal is either a herbivore or a carnivore (or both)", (\forall x\,\neg M(x)\lor H(x)\lor C(x)). Reasoning about such statements can, however, still be handled within the framework of term logic, although not by the 19 classical Aristotelian syllogisms alone.

Taking propositional logic as given, every formula in the monadic predicate calculus expresses something that can likewise be formulated in term logic. On the other hand, a modern view of the problem of multiple generality in traditional logic concludes that quantifiers cannot nest usefully if there are no polyadic predicates to relate the bound variables.

[edit] Variants

The formal system describe in this entry is sometimes called the pure monadic predicate calculus, where "pure" signifies the absence of function letters. Allowing monadic function letters changes the logic only superficially, whereas admitting even a single binary function letter would result in a system with the expressive power of the full predicate calculus.

Monadic predicate calculus is also called monadic first-order logic. Monadic second-order logic keeps the requirement that all predicates be unary, but allows for quantification over predicates as well as variables.

[edit] Footnotes

  1. ^ Heinrich Behmann, Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem, in Mathematische Annalen (1922)
Logic Portal
Languages