Timeline for Logical equivalence of logical propositions that are converted from compact (implicit) notation to Mathematica code
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 18, 2018 at 20:54 | comment | added | Henrik Schumacher | Honestly, I don't know. I have the feeling that the second one might make you happier on the long run. | |
| Sep 18, 2018 at 20:42 | vote | accept | vasili111 | ||
| Sep 17, 2018 at 12:49 | comment | added | vasili111 |
What about Equivalent[FullSimplify[hamlet], True]? Is it the same or maybe better than TautologyQ[Equivalent[hamlet, True]] ?
|
|
| Sep 17, 2018 at 12:38 | comment | added | Henrik Schumacher |
I am even not sure whether Equivalent performs any but the very simplest simplifications at all. Working seldomly with these things and not being a developer, I have few further knowledge about these things. All I can say: The general strategy about simplification in Mathematica is so that the user has to actively ask for more expensive simplifications. (Compare, e.g. Simplify and FullSimplify and the fact that they have further options that can be tuned.)
|
|
| Sep 17, 2018 at 12:29 | comment | added | vasili111 |
So, TautologyQ[] is only here to force Equivalent[] to make additional simplifications before Equivalent[] actually evaluates and nothing more?
|
|
| Sep 17, 2018 at 12:25 | comment | added | Henrik Schumacher |
For example, TautologicalQ might search the subexpressions for short-circuits. Equivalent alone probably does not do that for performance reasons.
|
|
| Sep 17, 2018 at 12:21 | comment | added | vasili111 |
.... Or maybe TautologyQ[] forces Equivalent[] to perform more simplifications before Equivalent[] evaluates and returns the result? In that case, TautologyQ[] is only here to force Equivalent[] to make additional simplifications and nothing more?
|
|
| Sep 17, 2018 at 12:21 | comment | added | vasili111 |
Here TautologyQ[Equivalent[hamlet, True]] as far as I understand first is evaluates Equivalent[hamlet, True] and only after TautologyQ[]. TautologyQ[] receives the only final result of Equivalent[] which can only be True orFalse. In that case, how TautologyQ[] can perform more simplifications? What more simplifications can be done on True orFalse? ....
|
|
| Sep 16, 2018 at 12:13 | history | edited | Henrik Schumacher | CC BY-SA 4.0 |
added 541 characters in body
|
| Sep 16, 2018 at 12:05 | history | answered | Henrik Schumacher | CC BY-SA 4.0 |