Testing wffs for equivalency
- From: un student <un.student@xxxxxxxxx>
- Date: Wed, 9 Jan 2008 00:04:58 -0800 (PST)
This question popped out in a conversation I had and I couldn't figure
anything useful out of it. Any thoughts?
If we have two different wffs a and b in FO could one test if they are
equivalent? Is it possible to write, say, an algorithm which takes two
wffs, tests if they are equal and returns true if they are and if they
differ provides a model in which one is true and the another is false?
If such algorithm exists would it be of "reasonable complexity" for
real life usage?
I think I have faced this question earlier but can't recall when and
couldn't find anything concerning it from my books.
.
- Follow-Ups:
- Re: Testing wffs for equivalency
- From: Peter_Smith
- Re: Testing wffs for equivalency
- Prev by Date: Re: Proof and entailment
- Next by Date: Re: Testing wffs for equivalency
- Previous by thread: CFP - The 1st International Workshop on Bit-Precise Reasoning (BPR 2008)
- Next by thread: Re: Testing wffs for equivalency
- Index(es):
Relevant Pages
|