On the Unsolvability of the Word Problem for a Class of Semigroups with a Solvable Isomorphism Problem

&
Journal of Symbolic Logic 33 (3):469-469 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270343

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Review: E. I. Grindlinger, On the Unsolvability of the Word Problem for a Class of Semigroups with a Solvable Isomorphism Problem; M. Greendlinger, Soviet Mathematics. [REVIEW]C. R. J. Clapham - 1968 - Journal of Symbolic Logic 33 (3):469-469.
Polynomial Time Uniform Word Problems.Stanley Burris - 1995 - Mathematical Logic Quarterly 41 (2):173-182.
A mechanical proof of the unsolvability of the halting problem.Robert Boyer - unknown
Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
Partial automorphism semigroups.Jennifer Chubb, Valentina S. Harizanov, Andrei S. Morozov, Sarah Pingrey & Eric Ufferman - 2008 - Annals of Pure and Applied Logic 156 (2):245-258.
The decision problem: solvable classes of quantificational formulas.Burton Dreben - 1979 - Reading, Mass.: Addison-Wesley, Advanced Book Program. Edited by Warren D. Goldfarb.
The word problem for semigroups with two generators.Marshall Hall - 1949 - Journal of Symbolic Logic 14 (2):115-118.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
The word problem for cancellation semigroups with zero.Yuri Gurevich & Harry R. Lewis - 1984 - Journal of Symbolic Logic 49 (1):184-191.
On stability and solvability (or, when does a neural network solve a problem?).Stan Franklin & Max Garzon - 1992 - Minds and Machines 2 (1):71-83.
Review: Marshall Hall, The Word Problem for Semigroups with Two Generators. [REVIEW]Martin Davis - 1950 - Journal of Symbolic Logic 14 (4):259-259.
The isomorphism problem for ω-automatic trees.Dietrich Kuske, Jiamou Liu & Markus Lohrey - 2013 - Annals of Pure and Applied Logic 164 (1):30-48.
The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length.Wesley Calvert - 2005 - Journal of Symbolic Logic 70 (1):331 - 345.
On Algorithmic Unsolvability of the Word Problem.P. S. Novikov - 1954 - Journal of Symbolic Logic 19 (1):58-60.
Isomorphism of Homogeneous Structures.John D. Clemens - 2009 - Notre Dame Journal of Formal Logic 50 (1):1-22.

Analytics

Added to PP
2015-02-05

Downloads
1 (#1,862,999)

6 months
1 (#1,444,594)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references