Decision problems concerning properties of finite sets of equations

Journal of Symbolic Logic 51 (1):79-87 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273945

Links

PhilArchive



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

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

Undecidable properties of finite sets of equations.George F. McNulty - 1976 - Journal of Symbolic Logic 41 (3):589-604.
Review: V. L. Murskii, D. M. Pritzker, Nondiscernible Properties of Finite Systems of Identity Relations; George F. McNulty, The Decision Problem for Equational Bases of Algebras; George F. McNulty, Undecidable Properties of Finite Sets of Equations. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
Decidable properties of finite sets of equations in trivial languages.Cornelia Kalfa - 1984 - Journal of Symbolic Logic 49 (4):1333-1338.
V. L. MurskiĬ. Nondiscernible properties of finite systems of identity relations. Soviet mathematics, vol. 12 , pp. 183–186. , pp. 520–522.) - George F. McNulty. The decision problem for equational bases of algebras. Annals of mathematical logic, vol. 10 , pp. 193–259. - George F. McNulty. Undecidable properties of finite sets of equations. The journal of symbolic logic, vol. 41 , pp. 589–604. [REVIEW]S. Burris - 1982 - Journal of Symbolic Logic 47 (4):903-904.
Decision problems for differential equations.J. Denef & L. Lipshitz - 1989 - Journal of Symbolic Logic 54 (3):941-950.
Finite automata, real time processes and counting problems in bounded arithmetics.Mirosław Kutyłowski - 1988 - Journal of Symbolic Logic 53 (1):243-258.
Decision Problems of Finite Automata Design and Related Arithmetics.C. C. Elgot - 1969 - Journal of Symbolic Logic 34 (3):509-510.
Classes of Recursively Enumerable Sets and their Decision Problems.H. G. Rice - 1954 - Journal of Symbolic Logic 19 (2):121-122.
Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.
Decision problems concerning s-arithmetic groups.Fritz Grunewald & Daniel Segal - 1985 - Journal of Symbolic Logic 50 (3):743-772.

Analytics

Added to PP
2009-01-28

Downloads
12 (#1,115,280)

6 months
40 (#99,457)

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

Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Unsolvable problems for equational theories.Peter Perkins - 1967 - Notre Dame Journal of Formal Logic 8 (3):175-185.
The decision problem for equational bases of algebras.George F. McNulty - 1976 - Annals of Mathematical Logic 10 (3):193.

Add more references