- From: Michael Brunnbauer <brunni@netestate.de>
- Date: Fri, 25 Mar 2011 11:00:25 +0100
- To: Michael Schneider <schneid@fzi.de>
- Cc: semantic-web@w3.org
re On Fri, Mar 25, 2011 at 12:00:52AM +0000, Michael Schneider wrote: > since skolemization retains equisatisfiability. But skolemization does /not/ > lead to logically equivalent graphs. I don't think this is of practical relevance. In logic skolemized statements are not logically equivalent to the original ones because you have introduced new symbols *in the whole system* and the truth of the original statement is independend of these symbols. If you look at statements and their skolemized versions as *different axiom systems* it should be possible to construct a model for the skolemized versions out of a model of the original versions and vice versa. the systems are somehow equivalent. I cannot substantiate that because I am not a logician. Regards, Michael Brunnbauer -- ++ Michael Brunnbauer ++ netEstate GmbH ++ Geisenhausener Straße 11a ++ 81379 München ++ Tel +49 89 32 19 77 80 ++ Fax +49 89 32 19 77 89 ++ E-Mail brunni@netestate.de ++ http://www.netestate.de/ ++ ++ Sitz: München, HRB Nr.142452 (Handelsregister B München) ++ USt-IdNr. DE221033342 ++ Geschäftsführer: Michael Brunnbauer, Franz Brunnbauer ++ Prokurist: Dipl. Kfm. (Univ.) Markus Hendel
Received on Friday, 25 March 2011 10:00:55 UTC