- From: Paola Di Maio <paola.dimaio@gmail.com>
- Date: Fri, 28 Jun 2019 13:34:21 +0800
- To: Patrick J Hayes <phayes@ihmc.us>
- Cc: SW-forum <semantic-web@w3.org>
- Message-ID: <CAMXe=SozpAihHNwge7Sr08F-zVFKNgcJjREYRbpUsMPmviOs8w@mail.gmail.com>
Thank you Pat do you think there may be some pointer in that article (or elsewhere) for the future of the semantic web? regarding FOL being the baseline for all logic maybe it was other people who said that i am still trying to get my mind around reality in general PDM On Thu, Jun 27, 2019 at 12:27 AM Patrick J Hayes <phayes@ihmc.us> wrote: > OK, I was afraid of this, getting into deep waters here :-) > > On Jun 26, 2019, at 12:40 AM, Paola Di Maio <paola.dimaio@gmail.com> > wrote: > > In relation to RDF and FOL > > Just thinking loud (not asking any question) > > I know that there is an underlying argument that all logic is essentially > FOL > > > I wouldn't make that strong a claim. There certainly are other logics. > > (never mind exceptions and other POVs > > Was going through some papers and some relevant points came up > > Automation of Higher-Order Logic > Authors: Christoph Benzm¨uller and Dale Miller Readers: Peter Andrews, > Jasmin Blanchette, William Farmer, Herman Geuvers, and Bruno Woltzenlogel > Paleo Venue: The Handbook of the History of Logic, eds. D. Gabbay & J. > Woods Volume 9: Logic and Computation, editor J¨org Siekmann > http://www.lix.polytechnique.fr/~dale/papers/automationHOL.pdf > > > I was using the term ‘higher-order’ in the way described here (section > 2.2, page 7) as the way that ‘philosophers of mathematics’ use it, in which > higher-order quantifiers range over the universe of /all/ functions. There > are those who would describe some logics that I call first-order as being > higher-order (or, HO syntax with nonstandard models, or Henkin HO logics, > or F-logic, or several other terms.) ISO Common Logic for example is such a > logic. It is HO in its syntax, so it “looks like” higher-order, but has a > strictly first-order semantics, and so can be handled by FO reasoning > engines. And it is FO by the criteria of the Lindstrom theorem. > > Pat > > > Bundy, A., van Harmelen, F., Horn, C., Smaill, A., 1990. The Oyster-Clam > system, in: Stickel, M.E. (Ed.), 10th International Conference on Automated > Deduction, > > Computational Logic Page 145 > > https://books.google.com.tw/books?id=H9-pCAAAQBAJ&lpg=PA145&ots=AidwU3D11M&dq=oyster%20logic&pg=PA145#v=onepage&q=oyster%20logic&f=false > > >
Received on Friday, 28 June 2019 05:35:23 UTC