Unformatted text preview: Given two languages: L 1 = L CON 1 and L 2 = L CON 2 , for CON 1 6 = CON 2 . We say that they are logically equivalent , i.e. L 1 â‰¡ L 2 if and only if the following conditions C1, C2 hold. C1: For every formula A of L 1 , there is a formula B of L 2 , such that A â‰¡ B, C2: For every formula C of L 2 , there is a formula D of L 1 , such that C â‰¡ D. Prove that L {Â¬ , âˆ© , â‡’} â‰¡ L {â†‘} . 1...
View
Full Document
 Spring '08
 Bachmair,L
 Computer Science, Logic, Equivalence relation, Equivalence, proper logical equivalences, following conditions C1

Click to edit the document details