home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.logic
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!ames!agate!spool.mu.edu!sdd.hp.com!wupost!gumby!destroyer!sol.ctr.columbia.edu!ira.uka.de!ira.uka.de!rz.uni-karlsruhe.de!stepsun.uni-kl.de!uklirb!ayala
- From: ayala@uklirb.informatik.uni-kl.de (Mauricio Ayala R.)
- Subject: Re: Why invalid? (was: Why logic?)
- Message-ID: <1992Nov17.164246.18220@uklirb.informatik.uni-kl.de>
- Organization: University of Kaiserslautern, Germany
- References: <1992Nov16.091653.1@woods.ulowell.edu> <lgfubaINN7v@peaches.cs.utexas.edu>
- Date: Tue, 17 Nov 1992 16:42:46 GMT
- Lines: 16
-
- Can anyone give me a counterexample of the following:
-
- Let T a consistent first order theory with equality which
- decidable set of quatifier-free logical consequences:
-
- QF(T) = { B | t |= B, B quantifier-free }
-
- Let A be a T-consistent quantifier-free formula.
- Then (T,A) is also a consistent first order logic with
- equality and QF(T,A) is ALSO DECIDABLE.
-
- M. Ayala
- Universitaet Kaiserslautern
- FRG
- ayala@informatik.uni-kl.de
-
-