Geoff Sutcliffe

Abstract

(although the FOF, unlike the CNF, is still a theorem). The correct version of Problem 62 is (following the format of (Pelletier, 1986)): Natural FOF Negated Conclusion CNF (Ax)r(Pet~(Px m Pf(x))) m Pf(f(x))] Pet Px+ P f(f(x)) + -Pa..

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

A probabilistic theory of extensive measurement.Jean-Claude Falmagne - 1980 - Philosophy of Science 47 (2):277-296.
Essay Review. [REVIEW]Víctor Sánchez Valencia - 1996 - History and Philosophy of Logic 17 (1 & 2):221-231.
Essay Review.Víctor Sánchez Valencia - 1996 - History and Philosophy of Logic 17 (1-2):221-231.
A model with no magic set.Krzysztof Ciesielski & Saharon Shelah - 1999 - Journal of Symbolic Logic 64 (4):1467-1490.
Ideals without CCC.Marek Balcerzak, Andrzej RosŁanowski & Saharon Shelah - 1998 - Journal of Symbolic Logic 63 (1):128-148.
Characterization of recursively enumerable sets.Jesse B. Wright - 1972 - Journal of Symbolic Logic 37 (3):507-511.

Analytics

Added to PP
2010-12-22

Downloads
17 (#1,158,190)

6 months
2 (#1,690,857)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references