Axiom systems for first order logic with finitely many variables
暂无分享,去创建一个
J. D. Monk has shown that for first order languages with finitely many variables there is no finite set of schema which axiomatizes the universally valid formulas. There are such finite sets of schema which axiomatize the formulas valid in all structures of some fixed finite size.
[1] B. Jonnson. Algebras Whose Congruence Lattices are Distributive. , 1967 .
[2] J. Donald Monk. Provability with finitely many variables , 1971 .
[3] Donald Monk,et al. On Equational Classes of Algebraic Versions of Logic I. , 1970 .