Finite axiomatizability for equational theories of computable groupoids

Journal of Symbolic Logic 54 (3):1018-1022 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

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

Non-finite-axiomatizability results in algebraic logic.Balázs Biró - 1992 - Journal of Symbolic Logic 57 (3):832 - 843.
Finite axiomatizability using additional predicates.W. Craig & R. L. Vaught - 1958 - Journal of Symbolic Logic 23 (3):289-308.
Semantical Closure and Non-Finite Axiomatizability I.R. Montague - 1964 - Journal of Symbolic Logic 29 (1):59-60.

Analytics

Added to PP
2009-01-28

Downloads
29 (#539,334)

6 months
7 (#594,125)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Unsolvable problems for equational theories.Peter Perkins - 1967 - Notre Dame Journal of Formal Logic 8 (3):175-185.

Add more references