Talk:Higher-order logic
From Wikipedia, the free encyclopedia
 |
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. | ||||||||
|
|||||||||
Another definition is that functions can not be passed as arguments in lower-order logic.
- Sure they can. \P\Q\x(R(P) ^ Q(x)). I guess that's actually lambda calc, but it's certainly not HOL. 24.95.48.112 01:53, 7 March 2007 (UTC)
- This sentence is vague to the point of comical "in first-order logic, roughly speaking, it is forbidden to quantify over predicates." Are we 'roughly speaking' or are we speaking of 'logic'?...we can't have both. i.e. Either 'first order logic' supports quantification over predicates, or it doesn't. Which is it? —Preceding unsigned comment added by 203.169.23.13 (talk) 22:10, 23 May 2008 (UTC)
