Abstract

We can look at this model theoretically as follows. By the linearly ordered predicate calculus, we simply mean ordinary predicate calculus with equality and a special binary relation symbol <. It is required that in all interpretations, < be a linear ordering on the domain. Thus we have the usual completeness theorem provided we add the axioms that assert that < is a linear ordering.