Ultravaluations and their Applications in CPL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textsf{CPL}$$\end{document}

This paper introduces the construct of an ultravaluation inspired by the well-known ultraproduct. Basic properties and exemplary applications of this notion are shown: for compactness and definability theorems. We also use ultravaluations to check failure of compactness and undefinability.


Introduction and Overview
The ultraproduct is a semantical construction of an immense importance both in model theory as well as abstract algebra.Besides its wide range of applications in the above mentioned fields, it has not been of any use in Classical Propositional Logic.In the present paper, we wish to keep some of the basic concepts behind the ultraproduct and propose new construction which will enable us to prove theorems for CPL analogous to those which can be found in first order model theory and abstract algebra.This way, we shall extend the universality of some of the fundamental Jerzy Loś's ideas.
The article introduces the concept of an ultravaluation, to some extent similar to the Loś's ultraproduct.The difference lies in the fact that in our proposal we do not use direct product operation and do not formulate congruence in the domain of a model-we consider valuations in CPL, so there is no reason to refer to any domain of a model.Furthermore, for our construction we prove theorem analogous to the Loś's theorem [4], which allows us to obtain several results.We start with an alternative proof of compactness for CPL.Then we move to the theorem saying that the set of valuations is definable iff it is closed under ultravaluations.We conclude that the set of valuations is definable iff it is compact.We also show a certain property of an ultravaluation which is in a sense analogous to the property of an ultraproduct.We use this property to show that any finite set of valuations is definable.Moreover, we give an example of a set of valuations which is not compact (definable) and use it to identify two types of sets of valuations which are not compact (definable). 1inally we pose an open question: to spot a set of valuations which is not of any of the two types and still is not compact (definable).

Background
We assume basic connectives to be ¬, ∧.L is set of propositional letters (can be uncountable).Formulas are built in a standard way.We shall use p, q, r, ... as variables for elements from L, ϕ, ψ, χ, ... for arbitrary formulas and Γ, Σ, ... for sets of formulas.Valuation for L is a function v : L −→ {0, 1}.The set of all L valuations will be denoted by {0, 1} L .Truth in a valuation is defined in a standard way: Let us state an important fact expressing CPL's perfect expressive power over its models, i.e. elementary equivalence in the set of valuations comes down to simple identity.

Fact 2.1 (Perfect expressive power). Let T h(
Proof.Right to left is trivial.For left to right assume v 1 = v 2 .Hence v 1 (p) = v 2 (p) for some p which means T h(v 1 ) = T h(v 2 ).This fact will turn out to be useful in later investigations.Also note that if the theory of a given valuation is included in a satisfiable set of formulas, then such set is identical to that theory, i.e.:

Fact 2.2 (Maximality of valuational theories). Let Σ be a satisfiable set of formulas and T h(v) ⊆ Σ for some valuation v. Then T h(v) = Σ.
Proof.For any v, T h(v) is maximally consistent set of formulas.
For the sake of later investigations, we need to recall the notion of an ultrafilter.For the more exhaustive exposition of filters and boolean algebras in general, an exemplary reference is Burris [1].Let W be a non-empty set.By P(W ) we will denote the set of all subsets W .We say that F ⊆ P(W ) is a filter over W if the following stipulations are met: Filter F over W is said to be proper iff F = P(W ).Here we give three equivalent definitions of an ultrafilter: Definition 2.3.Ultrafilter U over W is a proper filter that meets any of the following equivalent condition: Let A ⊆ P(W ).We say that A has the finite intersection property iff the intersection of any finite number of elements of A is non-empty: X 1 ∩...∩X n = ∅ for any n ∈ N such that X 1 , ..., X n ∈ A. The filter generated by A is the set {F ⊆ P(W ) : A ⊆ F and F is a filter over W }. It can be easily proven that such set is indeed a filter.We shall also recall the well-known fact about ultrafilters often referred to as the ultrafilter theorem.We will use this fact extensively in later investigations.

Fact 2.4. If A ⊆ P(W ) has the finite intersection property, then it can be extended to an ultrafilter.
Proof.To sketch a proof, it is enough to note that is a filter generated by A. Also by finite intersection property, ∅ / ∈ F .Since F is proper, it can be shown using Kuratowski-Zorn Lemma and Definition 2.3(iii) that F is included in an ultrafilter.
An ultrafilter U ⊆ P(W ) is called principal if it is generated by a singleton set {w} for some w ∈ W .By [{w}) we shall denote the set {X ⊆ W : w ∈ X}.It is routine to check that [{w}) is an ultrafilter generated by {w}.

Ultravaluation
Here, we will define the key concept of the paper: the ultravaluation.This notion will be incorporated in most proofs that will be presented.Definition 3.1 (Ultravaluation).Let (v i ) i∈I be an indexed family of valuations where I is non-empty.Let U ⊆ P(I) be an ultrafilter over I. Ultravaluation of (v i ) i∈I under U , shortly μ i∈I v i /U is given by the definition: Obviously, ultravaluation is well defined, hence μ i∈I v i /U ∈ {0, 1} L .In the face of the above definition, ultravaluation can be seen as a method of transforming a whole class of valuations into a single valuation.We can easily prove the analogon of Loś's theorem: Lemma 3.2 (Ultravaluation lemma).For any (v i ) i∈I , any ultrafilter U over I: Let us state an important property of ultravaluations, which says that an ultravaluation of an indexed family of valuations, whose underlying set is finite, is already included in that set.
For any q such that v k (q) = 0 we have As a corollary of the previous theorem, we can state that an ultravaluation of the same valuations-the notion analogous to an ultrapower-is always identical to a single component.Corollary 3.4.Let (v i ) i∈I be such that for each j, k ∈ I, v i = v j .Then μ i∈I v i /U = v i for any i ∈ I.
Note that Corollary 3.4 can be also proven directly from Fact 2.1 and Lemma 3.2.To see that, let i ∈ I.

Compactness and Definability
Compactness of CPL is usually proven as a corollary of completeness theorem with respect to some finite deductive aparatus.One of the exceptions is [3, pp. 7-8], where the method is purely model-theoretic.Here we will present an alternative model-theoretic proof, which uses the construct of an ultravaluation.It is important to note that our method covers both countable and uncountable languages.Proof.Let I be a set of all finite subsets of Σ and (v i ) i∈I be such that v i i for each i ∈ I. Let ϕ = {i ∈ I : v i ϕ} for each ϕ ∈ Σ.Notice that {ϕ : ϕ ∈ Σ} has the finite intersection property, since {ϕ 1 , ..., ϕ n } ∈ ϕ 1 ∩ ... ∩ ϕ n .By Fact 2.4 it can be extended to an ultrafilter.Let U be such an ultrafilter.For each ϕ ∈ Σ, ϕ = {i ∈ I : v i ϕ} ∈ U , hence by Lemma 3.2 μ i∈I v i /U ϕ for each ϕ ∈ Σ, which means Σ is satisfiable.
In order to prove further theorems, we need some definitions.Let us start with the closure under ultravaluations-the key concept which will allow us to obtain further results.Definition 4.2 (Closure under ultravaluations).Let K be a set of valuations.K is closed under ultravaluations iff for any I, any ultrafilter U over I, if for each i ∈ I, We also need to generalise the notion of compactness for arbitrary sets of valuations.

Definition 4.3 (Relative compactness
).Let K be a set of valuations.We say that K is compact iff for any set of formulas Σ, if each finite subset of Σ is satisfiable in K, then Σ is satisfiable in K.
The last definition states what does it mean for a given set of valuations to be definable.Definition 4.4.(Definability of a set of valuations) Let K be a set of valuations.K is definable iff there is a set of formulas Γ such that for any valuation v, v Γ iff v ∈ K. Now we can move on to our key results.Starting with relative compactness: Theorem 4.5 (Relative compactness).Let K be a set of valuations.K is compact iff K is closed under ultravaluations.
Proof.For right to left we reason as in Theorem 4.1.For the opposite direction, assume K is not closed under ultravaluations.Let v i ∈ K for each i ∈ I and It turns out that the similar result holds when we investigate definability.
Proof.For left to right assume Γ defines K. Let (v i ) i∈I be such that, for any i ∈ I, v i ∈ K. Let U be an ultrafilter over I.Note that for all ϕ ∈ Γ {i ∈ I : v i ϕ} = I ∈ U , so by Lemma 3.2 μ i∈I v i /U ϕ, for any ϕ ∈ Γ which means μ i∈I v i /U ∈ K.For the opposite direction assume K is closed under ultravaluations.Let Γ = {T h(v) : v ∈ K}.We will show that Γ defines K. Obviously if v ∈ K then v Γ for any v.For the opposite direction let v be such that v Γ. Observe that each finite subset of T h(v) is satisfiable in K. To see that assume for reductio that there is finite Σ = {ϕ 1 , ..., ϕ n } ⊆ T h(v) which is not satisfiable in K. Hence, for each v ∈ K v ¬ϕ 1 ∨ ... ∨ ¬ϕ n , which means that ¬ϕ 1 ∨ ... ∨ ¬ϕ n ∈ Γ.So v Σ-contradiction.Let I be a set of all finite subsets of T h(v) and (v i ) i∈I be such that it can be extended to an ultrafilter.Let U be such an ultrafilter.For each ϕ ∈ T h(v), ϕ = {i ∈ I : v i ϕ} ∈ U , hence by Lemma 3.2 μ i∈I v i /U ϕ for each ϕ ∈ T h(v).By Facts 2.2 and 2.1 v = μ i∈I v i /U ∈ K.This means that Γ defines K.

Corollaries
Now we will state some important corollaries of the above proven results.As a consequence of Theorems 4.1 and 4.6, we obtain the following theorem.We can also construct the defining set of formulas for finite set of valuations.Fact 4.9.Let K = {v 1 , ..., v n } be a finite set of valuations.Γ = {ϕ 1 ∨ ... ∨ ϕ n : v 1 ϕ 1 , ..., v n ϕ n } defines K.
Proof.Let K and Γ be as above.
Note that a set Γ defined as above can be in many cases a proper subset of {T h(v) : v ∈ K}.For this reason an additional remark may appear valuable: that for any definable set of valuations K, {T h(v) : v ∈ K} is the biggest (inclusion-wise) set of formulas which define K. To see that for any definable set of valuations K, {T h(v) : v ∈ K} defines K, note that K is closed under ultravaluation by Theorem 4.6 and then simply repeat the reasoning from the right-to-left part of the proof of Theorem 4.6.To prove that Γ ⊆ {T h(v) : v ∈ K} for any Γ which defines K, note that if ϕ / ∈ {T h(v) : v ∈ K}, then v ϕ for some v ∈ K, hence ϕ / ∈ Γ.Furthermore, we can prove that Cn(Γ) := {ϕ : Γ For the opposite inclusion, let ϕ / ∈ Cn(Γ).In consequence, Γ ϕ.Again using the fact that Γ defines K, v ∈ K and v ϕ, so ϕ / ∈ {T h(v) : v ∈ K}.The last corollary that we are going to present formulates necessary and sufficient conditions for a set of valuations to be definable by a single formula.By K − we shall denote {0, 1} L \ K. Theorem 4.10.K is definable by a single formula iff both K and K − are closed under ultravaluations.

Counterexamples
Let us provide an example of a set of valuations which is not definable (compact).By N we shall denote the set of natural numbers.), we conclude that K is not definable (compact).We can generalise our example to some kind of a theorem.To do that, we need to define the notion of the finite satisfaction property.

Theorem 4 . 1 (
Compactness of CPL).Let Σ be a set of formulas.If all finite subsets of Σ are satisfiable, then Σ is satisfiable.

Corollary 4 .
7. K is definable iff K is compact.By Theorems 3.3, 4.1 and Corollary 4.7 we obtain: Corollary 4.8.If K is finite, then K is definable/compact.