Logic Proofs : Through Ideal Inclusions

The two approaches of propositional logic (semantic and proof theoretic) are found to have equivelent formulations in commutative algebra over finite fields. In particular the semantic approach correspond to an algebro geometric formulation and the proof theoretic correspond to an ideal theoretic framework. Based on this correspondence a new completeness proof is given. An implementation of this proof system in Mathematica is also given