Monadic predicate calculus
Summary
In logic, the monadic predicate calculus (also called monadic first-order logic) is the fragment of first-order logic (also called predicate calculus) in which all relation symbols in the signature are monadic (that is, they take only one argument), and there are no function symbols. In other words, all atomic formulas are of the form , where is a relation symbol and is a term.
Further reading
- Wikipedia, page 8015680, revision 1371775840, Monadic predicate calculus. adopted
About this page
| Tag | SERN6CRVWW |
|---|---|
| URI | m2://SERN6CRVWW |
| Aliases | first-order-monadic-predicate-logic, monadic-first-order-logic, monadic-first-order-logic-of-order, monadic-logic, monadic-predicate-logic |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.