Theory of Completeness for Logical Spaces

A logical space is a pair (A, B){(A, {\mathcal{B}})} of a non-empty set A and a subset B{{\mathcal{B}}} of P A{{\mathcal{P}} A} . Since P A{{\mathcal{P}} A} is identified with {0, 1}^A and {0, 1} is a typical lattice, a pair (A, F){(A, {\mathcal{F}})} of a non-empty set A and a subset F{{\mathcal{F}}} of \mathbbB^A{{\mathbb{B}}^A} for a certain lattice \mathbbB{{\mathbb{B}}} is also called a \mathbbB{{\mathbb{B}}} -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms of these simplest concepts, a general framework for studying the logical completeness is constructed.