• Nem Talált Eredményt

Whose Logic is Three-Valued Logic?

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Whose Logic is Three-Valued Logic?"

Copied!
8
0
0

Teljes szövegt

(1)

Whose Logic is Three-Valued Logic?

U

U / ∈ U ι

D ( ι ) = U ∪ { U } Θ( ι ) = U

o

I = W × T W T

2010-4.indd 19

2010-4.indd 19 2011.01.21. 13:05:282011.01.21. 13:05:28

(2)

3 = {0 , 1 , 2} Θ( o ) = 2 p

w t

w t

ι o

o ( ι )

f : D ( o ) −→ D ( ι ) f ( U ) = 2 2

σ ( P ) : D ( ι ) −→ 3

| A |

vi

= A i = w, t ∈

W × T v i d ( i ) ⊆ D ( ι )

i w

t x ι v ( x )

D ( ι ) v ( x ) ∈ / d ( i ) | x |

vi

= Θ( ι )

ι w t

w t

F o ( ι )

I F F |I F |

vi

= u

i

{ u ∈ d ( i ) : | F |

vi

( u ) = 1} = { u

i

}

|I F |

vi

= Θ( ι ) F w

t |I F |

vi

F

|I F |

vi

o A B

α

| A = B |

vi

=

⎧ ⎪

⎪ ⎩

2 | A |

vi

= Θ( α ) | B |

vi

= Θ( α ) 1 | A |

vi

= | B |

vi

= Θ( α )

0

2

=

λ =

2010-4.indd 20

2010-4.indd 20 2011.01.21. 13:05:302011.01.21. 13:05:30

(3)

p ∼ p 1 0 0 1 2 2

p ∧ q 1 0 2 1 1 0 2 0 0 0 2 2 2 2 2

p ∨ q 1 0 2 1 1 1 2 0 1 0 2 2 2 2 2

= o

p ⊃ q 1 0 2 1 1 0 2 0 1 1 2 2 2 2 2

p ≡ q 1 0 2 1 1 0 2 0 0 1 2 2 2 2 2

p ¬ p 1 0 0 1 2 2

p & q 1 0 2 1 1 0 2 0 0 0 0 2 2 0 2

p ∨ q 1 0 2 1 1 1 1 0 1 0 2 2 1 2 2 p ⊃ q 1 0 2

1 1 0 2 0 1 1 1 2 1 2 2

p ≡ q 1 0 2 1 1 0 2 0 0 1 2 2 2 2 2

p p ∨ q 1

q

2010-4.indd 21

2010-4.indd 21 2011.01.21. 13:05:302011.01.21. 13:05:30

(4)

p p

p p p p p p

p 10

101010

π − 3

A α B β |A|

vi

= Θ(α) ⇒

|B|

vi

= Θ(β)

2010-4.indd 22

2010-4.indd 22 2011.01.21. 13:05:312011.01.21. 13:05:31

(5)

p

¬ p p

p p

¬ p

¬ p ¬¬ p

π

n 7

n

F

2010-4.indd 23

2010-4.indd 23 2011.01.21. 13:05:322011.01.21. 13:05:32

(6)

F

n n

F

n F ( n )

2010-4.indd 24

2010-4.indd 24 2011.01.21. 13:05:332011.01.21. 13:05:33

(7)

π

F

F ( n ) n

F ( n )

n F n

F n

F (0)

F (1) F ( n )

F (0)

F(1) F (2)

2010-4.indd 25

2010-4.indd 25 2011.01.21. 13:05:342011.01.21. 13:05:34

(8)

p

n F ( n )

n

2010-4.indd 26

2010-4.indd 26 2011.01.21. 13:05:352011.01.21. 13:05:35

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

A consistent theory is known to define all equiyalence relation (relative logical equivalence with respect to this theory) Oil the set of formulae of the language:

Reed-Muller-Fourier transform, discrete Pascal transform, eigenvector, eigenvalue, fixed point, multiple-valued logic, functions of several variables.. This study was supported by

In our study, our aim was to point out the importance of automotive sector in global economy, the introduction of fuzzy logic and the need for innovative solutions in

• Political actors left party logic behind in their communication for good and learnt media logic thus stepping into mediatisation where.. media does the agenda selection that

As we have seen earlier, AHUCA (MEFESZ 1 ), founded in 1945, was an umbrella organisation of higher education associations, and the name change in 1948, which changed the official

 bottom-up induction: using the relative LGG, it iteratively generalizes the current clauses as long as it is consistent with the negative examples3. - system based on this

Many-sorted logic is a version of first-order logic. Quantifiers and the argu- ments of the functions and relations are restricted in a sense. Many-sorted logic can be applied on

We will assume that the only connectives appearing in propositional formulae are Product conjunction, Product implication and Lukasiewicz implication. L OF is a first order language