Talk:Monadic predicate calculus

From Wikipedia, the free encyclopedia

Philosophy Portal

This article is within the scope of the WikiProject Philosophy, which collaborates on articles related to philosophy. To participate, you can edit this article or visit the project page for more details.

???

This article has not yet received a rating on the quality scale.

High

This article has been rated as high-importance on the importance scale.

Additional information:

Related task forces (core areas):
	Logic

[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 may be too technical for a general audience.
Please help improve this article by providing more context and better explanations of technical details to make it more accessible, without removing technical details.

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