• Keine Ergebnisse gefunden

We call a set C of connectives complete if for any formula A, there is an equivalent formulaB PFpCq

N/A
N/A
Protected

Academic year: 2021

Aktie "We call a set C of connectives complete if for any formula A, there is an equivalent formulaB PFpCq"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

SS 2013 30. April 2013 Exercises to the lecture Logics

Sheet 2

Jun.-Prof. Dr. Roland Meyer Due 10. Mai 2013

Exercise 2.1[Complete sets of connectives]

A and B are calledequivalent, denotedA() B, ifϕpAq ϕpBq for any valuationϕ.

For a setC of connectives, let FpCq be the set of formulae that contain no connectives other than those in C. We call a set C of connectives complete if for any formula A, there is an equivalent formulaB PFpCq.

a) Suppose you have the connective ¯^ (“NAND”), which satisfies ϕpABq 1mintϕpAq, ϕpBqu

for any formulae A, B. Using structural induction, show that t^u¯ is a complete set of connectives.

b) For valuations ϕ1, ϕ2, we write ϕ1 ¤ ϕ2 if ϕ1ppq ¤ ϕ2ppq for any propositional variablep. A formula A is said to be monotone if ϕ1 ¤ϕ2 implies ϕ1pAq ¤ ϕ2pAq for any valuationsϕ1, ϕ2 (in other words: the Boolean function corresdponding to Ais monotone). Using structural induction, show that every formula inFpt^,_uq is monotone.

c) Deduce from b) that t^,_u is not a complete set of connectives.

d) Show that for any monotone formula A, there is an equivalent one in Fpt^,_uq (Hint: Adapt the method for obtaining a DNF from a truth table and consider minimal satisfying valuations).

Exercise 2.2[Logical equivalence]

Show that the logical equivalence is a congruence relation, that is: If A () A1 and B ()B1, then also A() A1 and pABq () pA1B1q for any binary connective . Exercise 2.3[Horn formulae]

Suppose there are additional atomic formulae Jand K, which satisfy ϕpJq 1 and ϕpKq 0

for every valuationϕ. A Horn formula is a conjunction of formulaepAÑBq such that A and B are each a propositional variable or one of the symbols J and K. An example of such a formula is

ppÑqq ^ pJ Ñpq ^ pqÑpq ^ prÑ Kq.

Devise a method that decides whether a given Horn formula is satisfiable and try to make it as time efficient as possible (Hint: Successively check off occurrences of propositional variables). Explain why your method is faster than trying valuations one by one.

Delivery: until 10. Mai 2013 into the box next to room 34/401.4

Referenzen

ÄHNLICHE DOKUMENTE

Using structural induction, prove that for any formula there is an equivalent formula in negation

[r]

Suppose A 1 is formula in predicate logic that is obtained from a formula A in proposi- tional logic by replacing each variable with an atomic formula in predicate logic. Here,

A context-free grammar is called linear if in each rule, the right-hand side contains at most one occurrence of a nonterminal symbol.. Exercise

Note: Hence, you have shown that completeness means that the theory cannot be extended consistently in two ways that contradict

b) In Exercise 1.3 you saw that it is possible to construct an equivalent formula in DNF for any given formula. Explain why the following is not an efficient algorithm for

(b) Show that if the minimum of I is not unique, then it is possible that X n does not converge in probability. Exercise 2.4 (LDP for

Prove: Let CP(R, G) be defined as the set of critical pairs regarding R and the set of equations G oriented in both ways?. If R is left-linear, then the following statements