Talk:Monadic predicate calculus

Monadic first-order logic of order

why does the link for the above mentioned redirect here when there's no mention here of the order relation? — Preceding unsigned comment added by Houseofwealth (talk • contribs) 19:17, 9 February 2019 (UTC)

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)

---

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

MSO

as far as i know in monadic second order logic only the second order variables have arity 1. --84.148.78.213 19:29, 24 March 2007 (UTC)

Indeed. I've noticed this independently and corrected the article. Tijfo098 (talk) 04:20, 1 November 2012 (UTC)

Herbivore mammals

As far as I know, cows are herbivore mammals. Is there any good reason to choose a syllogism containing a false statement? Is it just a famous syllogism that I've never seen before? fudo (questions?) 17:26, 1 October 2008 (UTC)

I think Löwenheim proved the decidability of the monadic predicate calculus.

See the Gabbay & Woods (2009) Handbook of the History of Logic (Vol 5) (p 147).

I added the Löwenheim reference but didn't remove the other one. RussAbbott (talk) 05:59, 1 August 2011 (UTC)