一阶逻辑完备性定理的代数证明

An algebraic proof of completeness theorem of firstorder logic

在一阶逻辑中回避了通常使用的相容扩张方法,基于商Lindenbaum代数并引入一阶语言的一种γ 解释,证明了一阶逻辑的完备性定理.

Based on quotient Lindenbaum algebra, the present paper provides an algebraic proof of the completeness theorem without using any consistent extension, where the concept of γinterpretation introduced by the author plays an important role.