# help me define the connectives for 3 value logic

so basically i have a project about 3 valued logic ie truth=1 false = 0, unknown = 1/2

in a previous project I had to come up with formulae for 2 valued logic as follows:

negation
t(~p) = 1-t(p)

Conjunction
T(p^q) = min[t(p), t(q)]

Disjunction
T(p V q) = max[t(p), t(q)]

Conditional
~p -> q  === ~p V q => t(p->q) = t[~pVq]
=> max[t(~p), t(q)]
=> max[1-t(p), t(q)]

biconditional
p<->q === (p->q)^(q->p) => t(p->q) = t[(p->q)^(q->p)]
=> min[t(p->q), t(q->p)
=> min[max[1-t(p), t(q)], max[1-t(q), t(p)]]


using this information I have to define the connectives for 3 valued logic. and I dont really know how to do that. this is due tomorrow, please help!!! :(

-
This section of a Wikipedia article should at least get you started. – Brian M. Scott Jun 8 '12 at 7:57