Talk:Predicate functor logic
From Wikipedia, the free encyclopedia
 |
|||||
| Mathematics rating: | Start Class | Low Priority | Field: Foundations, logic, and set theory | ||
| Please update this rating as the article progresses, or if the rating is inaccurate. Please also add comments to suggest improvements to the article. | |||||
[edit] Sundry comments
A problem with expositing PFL is that Quine kept changing the notation until the 1982 final ed. of Methods of Logic. Kuhn (1983) and Bacon (1985) use notations that diverge from any that Quine employed. The primitives of Kuhn are Major and minor Inversion, and not Permutation. The alethic part of Bacon is the conditional and negation. Bacon has no primitive functor corresponding to Cropping'.
I would welcome additions to this article by anyone who feels comfortable with Bacon (1985). Mind you, that article is mostly in the Fitch natural deduction framework, and Wikipedia is weak on natural deduction, perhaps because it is now out of fashion. Has anyone written about PFL since Bacon (1985)?
Anybody care to comment about how PFL fits into the universal algebra family? Is it a Boolean algebra with monadic operators? If not, is it still a variety?Palnot (talk) 06:18, 21 January 2008 (UTC)
