Skip to main content icon/video/no-internet

Completeness is a property that theories can have when treated using the tools of modern mathematical logic and its mathematically precise treatment of logical consequence. This entry discusses two senses in which theories may be complete. Given the idealized view of theories logic employs, completeness in one sense has only been studied in relation to mathematical theories. But there is also a sense of completeness that applies to a theory of logical consequence, it is the completeness of a deductive system of logic.

Theories are a form of knowledge in which core concepts and assumptions are systematized so as to organize the understanding of the theory’s subject matter. The composition of theories in science can be very complicated. They may consist of data, experiments, models, and even research programs; they are not expressed in a uniform way. However, in logic theories are treated in an idealized and uniform way: All theories consist only of statements. Insofar as we can paraphrase the core elements of a theory into statements, this idealization is not misguided. Thinking of theories in these terms can help organize and reduce the number of core elements of a subject, since many other facts about the subject matter will follow directly from those core concepts. Logic studies a particular way that consequences can be drawn from statements, namely logical consequence. Statements are related by logical consequence when one statement follows from a set of statements with certainty. For example, the Law of Gravitation predicts the velocity at which a stone hits the ground when it falls from a cliff. This is an elementary instance of one statement about a particular stone’s velocity following, with certainty, from a general statement together with other statements about the particular height of the cliff.

Background on Logic and Consequence

There are two distinct notions of completeness: one that applies to theories, and one that applies to a deductive system of logic. In order to understand either of these ideas, the concepts of a logical language and logical consequence must be clear.

A logical language is a recursively defined set of sentences that are built up from atomic components using logical connectives. Logical languages may be defined so that they allow the use of particular connectives or names for particular objects, and the introduction of particular predicates or multi-place relations. These are languages that can easily be adapted to describe applications of logic to the empirical world. The logical language of sentential logic (SL), also called propositional logic or truth-functional logic, uses simple sentence atoms as basic units and introduces special symbols for the words and, not, and others. First-order or predicate logic uses names, variables, and multi-place relations to form basic sentence atoms and adds to the symbols from SL symbols for all and some. Some languages might adopt a particular predicate, for example, x < y, as well as a particular range for its variables, for example, the positive integers.

The logical language defines sentences syntactically, and they may have a formal or an informal interpretation or meaning. The relation of logical consequence is a relation between sentences of a logical language, some defined as the premises and others as the conclusion. The premises of an argument may deductively prove one or more conclusions. The consequences of the premises are what follows from the premises.

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading