About finite predicate logic (Q1088979)

We say that an n-argument predicate \(P\subset \Omega^ n\) is finite, if P is a finite set. Note that the set of individuals \(\Omega\) is infinite! Finite predicates are useful in data bases and in finite mathematics. The logic DBL proposed here operates on finite predicates only. We construct an imbedding for DBL in a special modal logic MPL. We prove that if a finite predicate is expressible in the classical logic, it is also expressible in DBL. Quantifiers are not necessary in DBL. Some simple algebraic properties of DBL are indicated.