Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



Semantical completeness theorems in logic and algebra

Author: Vladimir Lifschitz
Journal: Proc. Amer. Math. Soc. 79 (1980), 89-96
MSC: Primary 03F65; Secondary 03B99
MathSciNet review: 560591
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A few well-known algebraic theorems, including the Nullstellensatz and a form of the duality theorem of Farkas-Minkowsky, are shown to be corollaries to the completeness of the hyper-resolution method in proof theory.

References [Enhancements On Off] (What's this?)

  • [1] J. A. Robinson, Automatic deduction with hyper-resolution, Internat. J. Comput. Math. 1 (1965), 227-234. MR 0188081 (32:5522)
  • [2] Yu. V. Matijasevich, On metamathematical approach to proving theorems of discrete mathematics, Seminars in Mathematics, vol. 49, Steklov Mathematical Institute, Leningrad, 1975, pp. 31-50. (Russian, with English summary) MR 0376327 (51:12503)
  • [3] B. Scarpellini, On the metamathematics of rings and integral domains, Trans. Amer. Math. Soc. 138 (1969), 71-76. MR 0239941 (39:1295)
  • [4] W. Whiteley, Logic and invariant theory, Ph.D. Thesis, M.I.T., Cambridge, Mass., 1971.
  • [5] S. C. Kleene, Permutability of inferences in Gentzen's Calculi LK and LJ, Mem. Amer. Math. Society, no. 10, 1952.

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03F65, 03B99

Retrieve articles in all journals with MSC: 03F65, 03B99

Additional Information

Keywords: Hyper-resolution principle, Nullstellensatz
Article copyright: © Copyright 1980 American Mathematical Society

American Mathematical Society