 To express the logic, a Tarskian consequence operator will be used. Intuitively speaking, for any set \(A\) of sentences, \(\Cn(A)\) is the set of logical consequences of \(A\). More formally, a consequence operation on a given language is a function \(\Cn\) from sets of sentences to sets of sentences. It satisfies the following three conditions: