Infinitary logic

As a language with infinitely long formulae is being presented, it is not possible to write such formulae down explicitly. To get around this problem a number of notational conveniences, which, strictly speaking, are not part of the formal language, are used. ${\displaystyle \cdots }$ is used to point out an expression that is infinitely long. Where it is unclear, the length of the sequence is noted afterwards. Where this notation becomes ambiguous or confusing, suffixes such as ${\displaystyle \bigvee _{\gamma <\delta }{A_{\gamma }}}$ are used to indicate an infinite disjunction over a set of formulae of cardinality ${\displaystyle \delta }$. The same notation may be applied to quantifiers, for example ${\displaystyle \forall _{\gamma <\delta }{V_{\gamma }:}}$. This is meant to represent an infinite sequence of quantifiers: a quantifier for each ${\displaystyle V_{\gamma }}$ where ${\displaystyle \gamma <\delta }$.

All usage of suffixes and ${\displaystyle \cdots }$ are not part of formal infinitary languages.

The axiom of choice is assumed (as is often done when discussing infinitary logic) as this is necessary to have sensible distributivity laws.

A first-order infinitary language ${\displaystyle L_{\kappa ,\lambda }}$, ${\displaystyle \kappa }$ regular, ${\displaystyle \lambda =0}$ or ${\displaystyle \omega \leq \lambda \leq \kappa }$, has the same set of symbols as a finitary logic and may use all the rules for formation of formulae of a finitary logic together with some additional ones:^[4]

• Given a set of formulae ${\displaystyle A=\{A_{\gamma }|\gamma <\delta <\alpha \}}$ with ${\displaystyle |\alpha |<\kappa }$ then ${\displaystyle (A_{0}\lor A_{1}\lor \cdots )}$ and ${\displaystyle (A_{0}\land A_{1}\land \cdots )}$ are formulae. (In each case the sequence has length ${\displaystyle \delta }$.)
• Given a set of variables ${\displaystyle V=\{V_{\gamma }|\gamma <\delta <\beta \}}$ with ${\displaystyle |\beta |<\lambda }$ and a formula ${\displaystyle A_{0}}$ then ${\displaystyle \forall V_{0}:\forall V_{1}\cdots (A_{0})}$ and ${\displaystyle \exists V_{0}:\exists V_{1}\cdots (A_{0})}$ are formulae. (In each case the sequence of quantifiers has length ${\displaystyle \delta }$.)

The language may also have function, relation, and predicate symbols of finite arity.^[5] Karp also defined languages ${\displaystyle L_{\kappa \,\lambda o\pi }}$ with ${\displaystyle \pi \leq \kappa }$ an infinite cardinal and some more complicated restrictions on ${\displaystyle \mathrm {o} }$ that allow for function and predicate symbols of infinite arity, with ${\displaystyle \mathrm {o} }$ controlling the maximum arity of a function symbol and ${\displaystyle \pi }$ controlling predicate symbols.^[6]

The concepts of free and bound variables apply in the same manner to infinite formulae. Just as in finitary logic, a formula all of whose variables are bound is referred to as a sentence.

A theory ${\displaystyle T}$ in infinitary language ${\displaystyle L_{\alpha ,\beta }}$ is a set of sentences in the logic. A proof in infinitary logic from a theory ${\displaystyle T}$ is a (possibly infinite) sequence of statements that obeys the following conditions: Each statement is either a logical axiom, an element of ${\displaystyle T}$, or is deduced from previous statements using a rule of inference. As before, all rules of inference in finitary logic can be used, together with an additional one:

• Given a set of statements ${\displaystyle A=\{A_{\gamma }|\gamma <\delta <\alpha \}}$ that have occurred previously in the proof then the statement ${\displaystyle \land _{\gamma <\delta }{A_{\gamma }}}$ can be inferred.^[7]

If ${\displaystyle \beta <\alpha }$, forming universal closures may not always be possible, however extra constant symbols may be added for each variable with the resulting satisfiability relation remaining the same.^[8] To avoid this, some authors use a different definition of the language ${\displaystyle L_{\alpha ,\beta }}$ forbidding formulas from having more than ${\displaystyle \beta }$ free variables.^[9]

The logical axiom schemata specific to infinitary logic are presented below. Global schemata variables: ${\displaystyle \delta }$ and ${\displaystyle \gamma }$ such that ${\displaystyle 0<\delta <\alpha }$.

• ${\displaystyle ((\land _{\epsilon <\delta }{(A_{\delta }\implies A_{\epsilon })})\implies (A_{\delta }\implies \land _{\epsilon <\delta }{A_{\epsilon }}))}$
• For each ${\displaystyle \gamma <\delta }$, ${\displaystyle ((\land _{\epsilon <\delta }{A_{\epsilon }})\implies A_{\gamma })}$
• Chang's distributivity laws (for each ${\displaystyle \gamma }$): ${\displaystyle (\lor _{\mu <\gamma }{(\land _{\delta <\gamma }{A_{\mu ,\delta }})})}$, where ${\displaystyle \forall \mu \forall \delta \exists \epsilon <\gamma :A_{\mu ,\delta }=A_{\epsilon }}$ or ${\displaystyle A_{\mu ,\delta }=\neg A_{\epsilon }}$, and ${\displaystyle \forall g\in \gamma ^{\gamma }\exists \epsilon <\gamma :\{A_{\epsilon },\neg A_{\epsilon }\}\subseteq \{A_{\mu ,g(\mu )}:\mu <\gamma \}}$
• For ${\displaystyle \gamma <\alpha }$, ${\displaystyle ((\land _{\mu <\gamma }{(\lor _{\delta <\gamma }{A_{\mu ,\delta }})})\implies (\lor _{\epsilon <\gamma ^{\gamma }}{(\land _{\mu <\gamma }{A_{\mu ,\gamma _{\epsilon }(\mu )})}}))}$, where ${\displaystyle \{\gamma _{\epsilon }:\epsilon <\gamma ^{\gamma }\}}$ is a well ordering of ${\displaystyle \gamma ^{\gamma }}$

The last two axiom schemata require the axiom of choice because certain sets must be well orderable. The last axiom schema is strictly speaking unnecessary, as Chang's distributivity laws imply it,^[10] however it is included as a natural way to allow natural weakenings to the logic.

A theory is any set of sentences. The truth of statements in models are defined by recursion and will agree with the definition for finitary logic where both are defined. Given a theory T a sentence is said to be valid for the theory T if it is true in all models of T.

A logic in the language ${\displaystyle L_{\alpha ,\beta }}$ is complete if for every sentence S valid in every model there exists a proof of S. It is strongly complete if for any theory T for every sentence S valid in T there is a proof of S from T. An infinitary logic can be complete without being strongly complete.

A cardinal ${\displaystyle \kappa \neq \omega }$ is weakly compact when for every theory T in ${\displaystyle L_{\kappa ,\kappa }}$ containing at most ${\displaystyle \kappa }$ many formulas, if every S ${\displaystyle \subseteq }$ T of cardinality less than ${\displaystyle \kappa }$ has a model, then T has a model. A cardinal ${\displaystyle \kappa \neq \omega }$ is strongly compact when for every theory T in ${\displaystyle L_{\kappa ,\kappa }}$, without restriction on size, if every S ${\displaystyle \subseteq }$ T of cardinality less than ${\displaystyle \kappa }$ has a model, then T has a model.

In the language of set theory the following statement expresses foundation:

${\displaystyle \forall _{\gamma <\omega }{V_{\gamma }:}\neg \land _{\gamma <\omega }{V_{\gamma +}\in V_{\gamma }}.\,}$

Unlike the axiom of foundation, this statement admits no non-standard interpretations. The concept of well-foundedness can only be expressed in a logic that allows infinitely many quantifiers in an individual statement. As a consequence many theories, including Peano arithmetic, which cannot be properly axiomatised in finitary logic, can be in a suitable infinitary logic. Other examples include the theories of non-archimedean fields and torsion-free groups.^{[citation needed]} These three theories can be defined without the use of infinite quantification; only infinite junctions^[11] are needed.

Truth predicates for countable languages are definable in ${\displaystyle {\mathcal {L}}_{\omega _{1},\omega }}$.^[12]

Two infinitary logics stand out in their completeness. These are the logics of ${\displaystyle L_{\omega ,\omega }}$ and ${\displaystyle L_{\omega _{1},\omega }}$. The former is standard finitary first-order logic and the latter is an infinitary logic that only allows statements of countable size.

The logic of ${\displaystyle L_{\omega ,\omega }}$ is also strongly complete, compact and strongly compact.

The logic of ${\displaystyle L_{\omega _{1},\omega }}$ fails to be compact, but it is complete (under the axioms given above). Moreover, it satisfies a variant of the Craig interpolation property.

If the logic of ${\displaystyle L_{\alpha ,\alpha }}$ is strongly complete (under the axioms given above) then ${\displaystyle \alpha }$ is strongly compact (because proofs in these logics cannot use ${\displaystyle \alpha }$ or more of the given axioms).

• Karp, Carol R. (1964). Languages with Expressions of Infinite Length. North-Holland Publishing Company. doi:10.1016/S0049-237X(08)70423-3. ISBN 978-0-444-53401-9. {{cite book}}: ISBN / Date incompatibility (help)
• Barwise, Jon (1969). "Infinitary logic and admissible sets". The Journal of Symbolic Logic. 34 (2): 226–252. doi:10.2307/2271099. JSTOR 2271099.