- From: Francois Bry <bry@ifi.lmu.de>
- Date: Thu, 04 May 2006 09:16:30 +0200
- To: "Peter F. Patel-Schneider" <pfps@inf.unibz.it>
- CC: hak@ilog.com, public-rif-wg@w3.org
Peter F. Patel-Schneider wrote: >> http://logic.stanford.edu/~thinrich/herbrand/html/index.html >> > Now that that is cleared up ... > > From that page: > > With functions, entailment is not semi-decidable and satisfiability > is not semi-decidable. > > I wonder, then, what is the relationship between this logic and standard > FOL. > > peter > > FRom thatr page as well: Without functions, entailment is decidable. This is the case of logic programming, and, as I understand, considered by Michael. "Function symbols" are not "functions". Francois
Received on Thursday, 4 May 2006 07:16:38 UTC