An axiomatic theory is a formally given theory T = (τ, L, X) with an axioms list X, that means to define the class of its models, as that of all systems M interpreting the language L where all axioms (elements of X) are true, which will be denoted M⊨T.
A realistic theory is a theory involved to describe either a fixed or a variable system, i.e. a class of systems, seen as given from some independent reality. Its given axioms are statements which, for some reason, are considered known as true on all these systems. Such a theory is true if all its axioms are indeed true there. In this case, these systems are models, qualified as standard for contrast with other (unintended) models of that theory taken axiomatically.
This truth will usually be ensured for realistic theories of pure mathematics : arithmetic
and set theory (though the realistic meaning of set theory will not always be clear
depending on considered axioms). These theories will also admit nonstandard
models, making their realistic and axiomatic meanings effectively differ.
Outside pure mathematics, the truth of realistic theories may be dubious
(questionable): nonmathematical statements over nonmathematical systems
may be ambiguous (illdefined), while the truth of theories of applied mathematics
may be approximative, or speculative as the intended "real" systems may be
unknown (contingent among other possible ones). There, a theory is called
falsifiable if, in principle, the case
of its falsity can be discovered by comparing its predictions (theorems) with
observations. For example, biology is relative to a huge number of random
choices silently accumulated by Nature on Earth during billions of years ; it has
lots of "axioms" which are falsifiable and require a lot of empirical testing.
Nonrealistic theories outside mathematics (not called "axiomatic" by lack of mathematical
precision) would be works of fiction describing imaginary or possible future systems.
We say that A is provable in T, or a theorem of T, and write T ⊢ A if a proof of A in T exists. In practice, we only qualify as theorems the statements known as such, i.e. for which a proof is known. But synonyms for "theorem" are traditionally used according to their importance: a theorem is more important than a proposition; either of them may be deduced from an otherwise less important lemma, and easily implies an also less important corollary.
Any good proof theory needs of course to be sound, which means only "proving" always true statements : provability implies truth in every model (where all axioms are true).A proof of A using some axioms can also be seen as a proof of (conjunction of these axioms ⇒ A) without axiom, thus making this implication logically valid.
⊢ (A ∧ ¬A) ⇔ 0
((T ⊢ A) ∧ (T ⊢ B)) ⇔ (T ⊢ A∧B)
((T ⊢ A) ∧ (T ⊢ ¬A)) ⇔ (T ⊢ 0).
Beyond the required quality of soundness of the proof theoretical part of a logical framework, more remarkable is its converse quality of completeness : that for any axiomatic theory it describes, any statement that is true in all models is provable. In other words, any unprovable statement is false somewhere, and any irrefutable statement is true somewhere. Thus, any consistent theory has existing models, but often a diversity of them, as any undecidable statement is true in some and false in others. Adding some chosen undecidable statements to axioms leads to different consistent theories which can «disagree» without conflict, all truly describing different existing systems. This resolves much of a priori divergence between Platonism and formalism while giving proper mathematical definiteness to the a priori intuitive concepts of "proof", "theorem" and "consistency".
Set theory and Foundations of Mathematics  
1. First
foundations of mathematics 1.1. Introduction
to the foundations of mathematics
1.2. Variables, sets, functions and operations 1.3. Form of theories: notions,..., metaobjects 1.4. Structures of mathematical systems 1.5. Expressions and definable structures 1.6. Logical connectives 1.7. Classes in set theory 1.8. Binders in set theory ⇦ 
1.9. Axioms
and proofs
⇨ 1.10. Quantifiers 1.11. Secondorder quantifiers

Philosophical aspects  
2. Set theory  3. Algebra  4. Arithmetic  5. Secondorder foundations 