Complete theory

In mathematical logic, a theory is complete if it is a maximal consistent set of sentences, i.e., if it is consistent, and none of its proper extensions is consistent. For theories in logics which contain classical propositional logic, this is equivalent to asking that for every sentence φ in the language of the theory it contains either φ itself or its negation ¬φ.

Recursively axiomatizable first-order theories that are rich enough to allow general mathematical reasoning to be formulated cannot be complete, as demonstrated by Gödel's incompleteness theorem.

This sense of complete is distinct from the notion of a complete logic, which asserts that for every theory that can be formulated in the logic, all semantically valid statements are provable theorems (for an appropriate sense of "semantically valid"). Gödel's completeness theorem is about this latter kind of completeness.

Complete theories are closed under a number of conditions internally modelling the T-schema:

• For a set $S\!$: $A \land B \in S$ if and only if $A \in S$ and $B \in S$,
• For a set $S\!$: $A \lor B \in S$ if and only if $A \in S$ or $B \in S$.

Maximal consistent sets are a fundamental tool in the model theory of classical logic and modal logic. Their existence in a given case is usually a straightforward consequence of Zorn's lemma, based on the idea that a contradiction involves use of only finitely many premises. In the case of modal logics, the collection of maximal consistent sets extending a theory T (closed under the necessitation rule) can be given the structure of a model of T, called the canonical model.

Examples

Some examples of complete theories are:

• Presburger arithmetic
• Tarski's axioms for Euclidean geometry
• The theory of dense linear orders
• The theory of algebraically closed fields of a given characteristic
• The theory of real closed fields
• Every uncountably categorical countable theory
• Every countably categorical countable theory

References

Logic portal

• Mendelson, Elliott (1997). Introduction to Mathematical Logic (Fourth edition ed.). Chapman & Hall. pp. 86. ISBN 978-0-412-80830-2. 

This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Mathematical logic Model theory Mathematical logic stubs Wikimedia Foundation. 2010. Игры ⚽ Нужна курсовая? Electoral district of Manning Bob Schafer Look at other dictionaries: Model complete theory — In model theory, a first order theory is called model complete if every embedding of models is an elementary embedding. Equivalently, every first order formula is equivalent to a universal formula. This notion was introduced by Abraham Robinson.… …   Wikipedia Theory of mind — is the ability to attribute mental states beliefs, intents, desires, pretending, knowledge, etc. to oneself and others and to understand that others have beliefs, desires and intentions that are different from one s own.[1] Though there are… …   Wikipedia Theory (mathematical logic) — This article is about theories in a formal language, as studied in mathematical logic. For other uses, see Theory (disambiguation). In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. Usually… …   Wikipedia Theory of everything — A theory of everything (TOE) is a putative theory of theoretical physics that fully explains and links together all known physical phenomena. Initially, the term was used with an ironic connotation to refer to various overgeneralized theories.… …   Wikipedia Complete information — is a term used in economics and game theory to describe an economic situation or game in which knowledge about other market participants or players is available to all participants. Every player knows the payoffs and strategies available to other …   Wikipedia Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… …   Wikipedia Complete bipartite graph — A complete bipartite graph with m = 5 and n = 3 Vertices n + m Edges mn …   Wikipedia Complete graph — K7, a complete graph with 7 vertices Vertices n Edges …   Wikipedia Theory of Deep Democracy — Theory of Deep DemocracyThe theory of deep democracy makes a distinction between merely formal and deeper forms of democracy. Formal democracy is an important part of deep democracy, but it is merely a beginning or a necessary condition. In order …   Wikipedia Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”