Talk:Monadic predicate calculus

From Wikipedia, the free encyclopedia

You have new messages (last change).

[edit] Syllogisms

I don't follow. Syllogistic logic should be binary or dyadic: All A is B is a function of two variables, isn't it? Septentrionalis 20:07, 19 November 2006 (UTC)

No. In modern notation "Every A is a B" would be rendered \forall x.A(x)\Rightarrow B(x). Remember that A and B are (mondaic) predicates, not individuals. From a modern viewpoint, the problem of multiple generality is that one cannot usefully nest quantifiers without a formal machinery for speaking about multiary predicates. Henning Makholm 20:18, 19 November 2006 (UTC)
I see what you mean; it might be helpful to put this in the article. Septentrionalis 22:42, 19 November 2006 (UTC)
I have tried to improve the description. Better now? Henning Makholm 00:03, 20 November 2006 (UTC)


This article needs more context around or a better explanation of technical details to make it more accessible to general readers and technical readers outside the specialty, without removing technical details. See below for more information.


Please make this article more accessible to the lay reader. 69.140.173.15 17:01, 25 November 2006 (UTC)

Retrieved from "http://en.wikipedia.org../../../m/o/n/Talk%7EMonadic_predicate_calculus_4777.html"