In mathematical logic, a theory (also called a formal theory) is a set of sentences in a formal language. In most scenarios a deductive system is first understood from context, after which an element of a deductively closed theory is then called a theorem of the theory. In many deductive systems there is usually a subset that is called "the set of axioms" of the theory , in which case the deductive system is also called an "axiomatic system". By definition, every axiom is automatically a theorem. A firstorder theory is a set of firstorder sentences (theorems) recursively obtained by the inference rules of the system applied to the set of axioms.
YouTube Encyclopedic

1/5Views:30 98121 9034 087262 95435 305

[Discrete Math 1] Introduction to Propositional Logic

Logic and Set Theory

Mathematical Logicswitching circuit  application of logic  circuit diagram  mathematical logic

Truth Table Tutorial  Discrete Mathematics Logic

[Discrete Math 1] Rules of Inference
Transcription
General theories (as expressed in formal language)
When defining theories for foundational purposes, additional care must be taken, as normal settheoretic language may not be appropriate.
The construction of a theory begins by specifying a definite nonempty conceptual class , the elements of which are called statements. These initial statements are often called the primitive elements or elementary statements of the theory—to distinguish them from other statements that may be derived from them.
A theory is a conceptual class consisting of certain of these elementary statements. The elementary statements that belong to are called the elementary theorems of and are said to be true. In this way, a theory can be seen as a way of designating a subset of that only contain statements that are true.
This general way of designating a theory stipulates that the truth of any of its elementary statements is not known without reference to . Thus the same elementary statement may be true with respect to one theory but false with respect to another. This is reminiscent of the case in ordinary language where statements such as "He is an honest person" cannot be judged true or false without interpreting who "he" is, and, for that matter, what an "honest person" is under this theory.^{[1]}
Subtheories and extensions
A theory is a subtheory of a theory if is a subset of . If is a subset of then is called an extension or a supertheory of
Deductive theories
A theory is said to be a deductive theory if is an inductive class, which is to say that its content is based on some formal deductive system and that some of its elementary statements are taken as axioms. In a deductive theory, any sentence that is a logical consequence of one or more of the axioms is also a sentence of that theory.^{[1]} More formally, if is a Tarskistyle consequence relation, then is closed under (and so each of its theorems is a logical consequence of its axioms) if and only if, for all sentences in the language of the theory , if , then ; or, equivalently, if is a finite subset of (possibly the set of axioms of in the case of finitely axiomatizable theories) and , then , and therefore .
Consistency and completeness
A syntactically consistent theory is a theory from which not every sentence in the underlying language can be proven (with respect to some deductive system, which is usually clear from context). In a deductive system (such as firstorder logic) that satisfies the principle of explosion, this is equivalent to requiring that there is no sentence φ such that both φ and its negation can be proven from the theory.
A satisfiable theory is a theory that has a model. This means there is a structure M that satisfies every sentence in the theory. Any satisfiable theory is syntactically consistent, because the structure satisfying the theory will satisfy exactly one of φ and the negation of φ, for each sentence φ.
A consistent theory is sometimes defined to be a syntactically consistent theory, and sometimes defined to be a satisfiable theory. For firstorder logic, the most important case, it follows from the completeness theorem that the two meanings coincide.^{[2]} In other logics, such as secondorder logic, there are syntactically consistent theories that are not satisfiable, such as ωinconsistent theories.
A complete consistent theory (or just a complete theory) is a consistent theory such that for every sentence φ in its language, either φ is provable from or {φ} is inconsistent. For theories closed under logical consequence, this means that for every sentence φ, either φ or its negation is contained in the theory.^{[3]} An incomplete theory is a consistent theory that is not complete.
(see also ωconsistent theory for a stronger notion of consistency.)
Interpretation of a theory
An interpretation of a theory is the relationship between a theory and some subject matter when there is a manytoone correspondence between certain elementary statements of the theory, and certain statements related to the subject matter. If every elementary statement in the theory has a correspondent it is called a full interpretation, otherwise it is called a partial interpretation.^{[4]}
Theories associated with a structure
Each structure has several associated theories. The complete theory of a structure A is the set of all firstorder sentences over the signature of A that are satisfied by A. It is denoted by Th(A). More generally, the theory of K, a class of σstructures, is the set of all firstorder σsentences that are satisfied by all structures in K, and is denoted by Th(K). Clearly Th(A) = Th({A}). These notions can also be defined with respect to other logics.
For each σstructure A, there are several associated theories in a larger signature σ' that extends σ by adding one new constant symbol for each element of the domain of A. (If the new constant symbols are identified with the elements of A that they represent, σ' can be taken to be σ A.) The cardinality of σ' is thus the larger of the cardinality of σ and the cardinality of A.^{[further explanation needed]}
The diagram of A consists of all atomic or negated atomic σ'sentences that are satisfied by A and is denoted by diag_{A}. The positive diagram of A is the set of all atomic σ'sentences that A satisfies. It is denoted by diag^{+}_{A}. The elementary diagram of A is the set eldiag_{A} of all firstorder σ'sentences that are satisfied by A or, equivalently, the complete (firstorder) theory of the natural expansion of A to the signature σ'.
Firstorder theories
A firstorder theory is a set of sentences in a firstorder formal language .
Derivation in a firstorder theory
There are many formal derivation ("proof") systems for firstorder logic. These include Hilbertstyle deductive systems, natural deduction, the sequent calculus, the tableaux method and resolution.
Syntactic consequence in a firstorder theory
A formula A is a syntactic consequence of a firstorder theory if there is a derivation of A using only formulas in as nonlogical axioms. Such a formula A is also called a theorem of . The notation "" indicates A is a theorem of .
Interpretation of a firstorder theory
An interpretation of a firstorder theory provides a semantics for the formulas of the theory. An interpretation is said to satisfy a formula if the formula is true according to the interpretation. A model of a firstorder theory is an interpretation in which every formula of is satisfied.
Firstorder theories with identity
A firstorder theory is a firstorder theory with identity if includes the identity relation symbol "=" and the reflexivity and substitution axiom schemes for this symbol.
 Compactness theorem
 Consistent set
 Deduction theorem
 Enumeration theorem
 Lindenbaum's lemma
 Löwenheim–Skolem theorem
Examples
One way to specify a theory is to define a set of axioms in a particular language. The theory can be taken to include just those axioms, or their logical or provable consequences, as desired. Theories obtained this way include ZFC and Peano arithmetic.
A second way to specify a theory is to begin with a structure, and let the theory be the set of sentences that are satisfied by the structure. This is a method for producing complete theories through the semantic route, with examples including the set of true sentences under the structure (N, +, ×, 0, 1, =), where N is the set of natural numbers, and the set of true sentences under the structure (R, +, ×, 0, 1, =), where R is the set of real numbers. The first of these, called the theory of true arithmetic, cannot be written as the set of logical consequences of any enumerable set of axioms. The theory of (R, +, ×, 0, 1, =) was shown by Tarski to be decidable; it is the theory of real closed fields (see Decidability of firstorder theories of the real numbers for more).
See also
References
 ^ ^{a} ^{b} Haskell Curry, Foundations of Mathematical Logic, 2010.
 ^ Weiss, William; D'Mello, Cherie (2015). "Fundamentals of Model Theory" (PDF). University of Toronto — Department of Mathematics.
 ^ "Completeness (in logic)  Encyclopedia of Mathematics". www.encyclopediaofmath.org. Retrieved 20191101.
 ^ Haskell Curry (1963). Foundations of Mathematical Logic. Mcgraw Hill. Here: p.48
Further reading
 Hodges, Wilfrid (1997). A shorter model theory. Cambridge University Press. ISBN 0521587131.