Relationship of consistency, axiomatizability, and decidability

Question

I'm trying to get a better grasp of the relationship between these concepts so I have a few questions about them.

Does a consistent theory have to be (or have to not be) axiomatizable?

Does an inconsistent theory need to be axiomatizable? (Is the answer yes because all inconsistent theories are the same in that anything is provable?)

Does an axiomatizable have to be decidable?

And are decidable theories always complete/what's their relation?

A specific example for some of these is robinson arithmetic which I know is axiomatized and incomplete. Is it decidable? Could it be extended to be decidable or complete? Would this be an example of an axiomatizable theory that's not decidable?

Sorry if this is scattered, there are a lot of relationships here I'm not sure how to connect.

Answer 1

Does a consistent theory have to be (or have to not be) axiomatizable?

No a consistent theory may or may not be axiomatizable. First order Peano Arithmetic is consistent (we hope) and axiomatized. First order True Arithmetic (all the truths of the first order language of arithmetic) is consistent but not axiomatizable.

Does an inconsistent theory need to be axiomatizable?

In a classical setting, an inconsistent theory proves everything (in the relevant language). So is axiomatized by the theory which has every sentence (of the relevant language) as an axiom.

Does an axiomatizable theory have to be decidable?

No. First-order Peano Arithmetic is, if consistent, not decidable.

Are decidable theories always complete.

No. The empty theory with no axioms is decidable (no sentence is a thoerem!) but not complete.

A specific example for some of these is robinson arithmetic which I know is axiomatized and incomplete. Is it decidable?

No it isn't.

Could it be extended to be decidable or complete?

It can be extended to a complete theory, complete True Arithmetic -- but that is neither axiomatizable nor decidable.

It can be extended to the inconsistent theory which is decidable, complete, and axiomatizable ... but sadly useless.

No axiomatizable consistent extension of Robinson Arithmetic is complete.

The usual textbooks will spell this out for you. (See §4.2 of the Teach Yourself Logic Study Guide for relevant recommended texts.)

Answer 2

Just an addendum to Peter Smith's answer:

Does an inconsistent theory need to be axiomatizable? (Is the answer yes because all inconsistent theories are the same in that anything is provable?)

Any inconsistent theory can be axiomatized by the following axiom set: $\{ \bot \}$

Does an axiomatizable have to be decidable?

No. The fact that a theory is axiomatizable means that there exists a recursive set of axioms whose logical consequences make up that theory. As such, the set of axioms themselves is decidable. However, first-order logical consequence is not decidable, and so the theory as a whole may not be decidable. In fact, since the very set of first-order logical tautologies is undecidable (that is: since first-order logic itself is undecidable), and since all first-order logic tautologies are first-order logical consequences of any theory, no first-order logic theory is decidable.