摘要: Our first goal is to characterize the consequence relation in a first-order language by means of calculus similar that propositional logic. That this attainable at all was shown for time Gdel [Go1]. The original version Gdel’s theorem refers axiomatization tautologies only and does not immediately imply compactness logic; but more general formulation completeness 3.2 does. importance mathematical applications revealed 1936 A. Malcev, see [Ma].
springer.com
sci-hub.st 参考文章(18)
Wanda Szmielew, Elementary properties of Abelian groups Fundamenta Mathematicae. ,vol. 41, pp. 203- 271 ,(1955) , 10.4064/FM-41-2-203-271
Czesław Ryll-Nardzewski, The role of the axiom of induction in elementary arithmetic Fundamenta Mathematicae. ,vol. 39, pp. 239- 263 ,(1952) , 10.4064/FM-39-1-239-263
Gerhard Gentzen, M. E. Szabo, The collected papers of Gerhard Gentzen ,(1969)
Paweł Idziak, None, A Characterization of Finitely Decidable Congruence Modular Varieties Transactions of the American Mathematical Society. ,vol. 349, pp. 903- 934 ,(1997) , 10.1090/S0002-9947-97-01904-1
Wolfram Pohlers, Proof Theory: An Introduction ,(1989)
Egon Borger, Erich Grädel, Yuri Gurevich, The Classical Decision Problem ,(1997)
Pavel Pudlák, Petr Hájek, Metamathematics of First-Order Arithmetic ,(1992)
Elliott Mendelson, Introduction to Mathematical Logic ,(1964)
A. Selman, Completeness of calculii for axiomatically defined classes of algebras Algebra Universalis. ,vol. 2, pp. 20- 32 ,(1972) , 10.1007/BF02945004