Fine Degrees of Word Problems of Cancellation Semigroups

Mathematical Logic Quarterly 26 (1‐6):93-95 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19800260111

Links

PhilArchive



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

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

The word problem for cancellation semigroups with zero.Yuri Gurevich & Harry R. Lewis - 1984 - Journal of Symbolic Logic 49 (1):184-191.
Review: B. H. Mayoh, Groups and Semigroups with Solvable Word Problems. [REVIEW]F. B. Cannonito - 1971 - Journal of Symbolic Logic 36 (3):541-541.
The degrees of conditional problems.Su Gao - 1994 - Journal of Symbolic Logic 59 (1):166-181.
The distribution of the generic recursively enumerable degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Daggers, Kernels, Baer *-semigroups, and Orthomodularity.John Harding - 2013 - Journal of Philosophical Logic 42 (3):535-549.
The word problem for semigroups with two generators.Marshall Hall - 1949 - Journal of Symbolic Logic 14 (2):115-118.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
Review: Marshall Hall, The Word Problem for Semigroups with Two Generators. [REVIEW]Martin Davis - 1950 - Journal of Symbolic Logic 14 (4):259-259.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.
Conversational implicatures and cancellability.Steffen Borge - 2009 - Acta Analytica 24 (2):149-154.
On the structure of rotation-invariant semigroups.Sándor Jenei - 2003 - Archive for Mathematical Logic 42 (5):489-514.
Review: A. M. Turing, The Word Problem in Semi-Groups with Cancellation. [REVIEW]William W. Boone - 1952 - Journal of Symbolic Logic 17 (1):74-76.
Review: William W. Boone, Partial Results Regarding Word Problems and Recursively Enumerable Degrees of Unsolvability. [REVIEW]Marian Boykan Pour-El - 1963 - Journal of Symbolic Logic 28 (4):292-292.

Analytics

Added to PP
2013-11-24

Downloads
9 (#1,224,450)

6 months
3 (#992,474)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references