Higman's Embedding Theorem in a General Setting and Its Application to Existentially Closed Algebras

Notre Dame Journal of Formal Logic 37 (4):613-624 (1996)
  Copy   BIBTEX

Abstract

For a quasi variety of algebras K, the Higman Theorem is said to be true if every recursively presented K-algebra is embeddable into a finitely presented K-algebra; the Generalized Higman Theorem is said to be true if any K-algebra which is recursively presented over its finitely generated subalgebra is embeddable into a K-algebra which is finitely presented over this subalgebra. We suggest certain general conditions on K under which the Higman Theorem implies the Generalized Higman Theorem; a finitely generated K-algebra A is embeddable into every existentially closed K-algebra containing a finitely generated K-algebra B if and only if the word problem for A is Q-reducible to the word problem for B. The quasi varieties of groups, torsion-free groups, and semigroups satisfy these conditions

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

Modules of existentially closed algebras.Paul C. Eklof & Hans-Christian Mez - 1987 - Journal of Symbolic Logic 52 (1):54-63.
The ideal structure of existentially closed algebras.Paul C. Eklof & Hans-Christian Mez - 1985 - Journal of Symbolic Logic 50 (4):1025-1043.
Some remarks on openly generated Boolean algebras.Sakaé Fuchino - 1994 - Journal of Symbolic Logic 59 (1):302-310.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.

Analytics

Added to PP
2010-08-24

Downloads
13 (#978,482)

6 months
6 (#431,022)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

$$sQ_1$$ -degrees of computably enumerable sets.Roland Sh Omanadze - 2023 - Archive for Mathematical Logic 62 (3):401-417.

Add more citations

References found in this work

Omitting quantifier-free types in generic structures.Angus Macintyre - 1972 - Journal of Symbolic Logic 37 (3):512-520.
Subgroups of Finitely Presented Groups.G. Higman - 1964 - Journal of Symbolic Logic 29 (4):204-205.

Add more references