MathGroup Archive 2009

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: logical simplification problem

  • To: mathgroup at smc.vnet.net
  • Subject: [mg101456] Re: [mg101442] logical simplification problem
  • From: Daniel Lichtblau <danl at wolfram.com>
  • Date: Wed, 8 Jul 2009 07:07:36 -0400 (EDT)
  • References: <200907071147.HAA27538@smc.vnet.net>

olfa wrote:
> Hi mathematica community,
> if it does not exist as predefined function in mathematica, how to
> define a rule that illustrate this logical property: if p implies q
> then p || q is simplified into q and p&&q is simplified into p?
> Thank you for your help.

Possibly you are looking for BooleanMinimize.

In[15]:= BooleanMinimize[{p || q, p && q}, "DNF", Implies[p, q]]

Out[15]= {q, p}

Daniel Lichtblau
Wolfram Research


  • Prev by Date: Re: Jens-Peer Kuska passed away
  • Next by Date: Re: Pattern matching / subsequence matching, question on
  • Previous by thread: Re: logical simplification problem
  • Next by thread: Re: logical simplification problem