# Consistency and completeness of any arbitrary 3-valued logic? [closed]

Based on the explanations here [1] I know that 3-valued first order logic has many different versions, which differ in the definition of their operations (e.g. implication). All of these (as far as I know) are complete, i.e. any probable statement could be proven. Also these are (just as in the 2-valued case are Semi-decidable, i.e. the correctness of statement given axioms, could be proved, also wrong statements could not be disproved.) Also these are consistent, i.e. they don't contain contradiction.

Suppose I define my arbitrary 3-valued first order logic (by arbitrary, I mean, arbitrary $\Rightarrow$, AND, OR). Is it true that, it is

• COMPLETE,

• SEMI-DECIDABLE

• CONSISTENT

for any $\Rightarrow$, AND, OR operations?

## closed as off-topic by Kaveh, R B, David Eppstein, Sasho Nikolov, Tsuyoshi ItoAug 30 '14 at 23:12

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Kaveh, R B, David Eppstein, Sasho Nikolov, Tsuyoshi Ito
If this question can be reworded to fit the rules in the help center, please edit the question.