Unsolvable problems for equational theories

Notre Dame Journal of Formal Logic 8 (3):175-185 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093956081

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

My notes

Similar books and articles

Theories with equational forking.Markus Junker & Ingo Kraus - 2002 - Journal of Symbolic Logic 67 (1):326-340.
Proving consistency of equational theories in bounded arithmetic.Arnold Beckmann† - 2002 - Journal of Symbolic Logic 67 (1):279-296.
Unsolvable Problems and Philosophical Progress.William J. Rapaport - 1982 - American Philosophical Quarterly 19 (4):289 - 298.
A note on definability in equational logic.George Weaver - 1994 - History and Philosophy of Logic 15 (2):189-199.
Unsolvable problems, visual imagery, and explanatory satisfaction.Marc F. Krellenstein - 1995 - Journal of Mind and Behavior 16 (3):235-54.
Finite axiomatizability for equational theories of computable groupoids.Peter Perkins - 1989 - Journal of Symbolic Logic 54 (3):1018-1022.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Are There Absolutely Unsolvable Problems? Godel's Dichotomy.S. Feferman - 2006 - Philosophia Mathematica 14 (2):134-152.
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions.Martin Davis (ed.) - 1965 - Hewlett, NY, USA: Dover Publication.
Unsolvable Problems.A. H. Basson - 1957 - Proceedings of the Aristotelian Society 57:269 - 280.
After Gödel: Mechanism, Reason, and Realism in the Philosophy of Mathematics.Richard Tieszen - 2006 - Philosophia Mathematica 14 (2):229-254.
An unsolvable provability problem for one variable groupoid equations.Peter Perkins - 1972 - Notre Dame Journal of Formal Logic 13 (3):359-362.
For everyn, then-freely generated algebra is not functionally free in the equational class of diagonalizable algebras.Franco Montagna - 1975 - Studia Logica 34 (4):315 - 319.
Equational approach to argumentation networks.D. M. Gabbay - 2012 - Argument and Computation 3 (2-3):87 - 142.
Near-equational and equational systems of logic for partial functions. I.William Craig - 1989 - Journal of Symbolic Logic 54 (3):795-827.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,025,624)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Undecidable properties of finite sets of equations.George F. McNulty - 1976 - Journal of Symbolic Logic 41 (3):589-604.
Restricted Decision Problems in Some Classes of Algebraic Systems.Michałl Muzalewski - 1978 - Mathematical Logic Quarterly 24 (17‐18):279-287.

View all 11 citations / Add more citations

References found in this work

No references found.

Add more references