Axiom systems for first order logic with finitely many variables

Journal of Symbolic Logic 38 (4):576-578 (1973)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2271983
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,492
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
On Varieties of Cylindric Algebras with Applications to Logic.I. Németi - 1987 - Annals of Pure and Applied Logic 36 (3):235-277.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
8 ( #498,551 of 2,180,637 )

Recent downloads (6 months)
1 ( #302,009 of 2,180,637 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums