Axiom systems for first order logic with finitely many variables

Journal of Symbolic Logic 38 (4):576-578 (1973)
  Copy   BIBTEX

Abstract

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
26 (#577,276)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On varieties of cylindric algebras with applications to logic.I. Németi - 1987 - Annals of Pure and Applied Logic 36:235-277.

Add more citations

References found in this work

Algebraic Logic.Aubert Daigneault - 1962 - Journal of Symbolic Logic 27 (4):469-470.

Add more references