- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Undecidable properties of finite sets of equations
Journal of Symbolic Logic 41 (3):589-604 (1976)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
Decidable properties of finite sets of equations in trivial languages.Cornelia Kalfa - 1984 - Journal of Symbolic Logic 49 (4):1333-1338.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
A decidable variety that is finitely undecidable.Joohee Jeong - 1999 - Journal of Symbolic Logic 64 (2):651-677.
On the expressivity of feature logics with negation, functional uncertainty, and sort equations.Franz Baader, Hans-Jürgen Bürckert, Bernhard Nebel, Werner Nutt & Gert Smolka - 1993 - Journal of Logic, Language and Information 2 (1):1-18.
The First-Order Structure of Weakly Dedekind-Finite Sets.A. C. Walczak-Typke - 2005 - Journal of Symbolic Logic 70 (4):1161 - 1170.
Rational choice on non-finite sets by means of expansion-contraction axioms.M. Carmen Sánchez - 1998 - Theory and Decision 45 (1):1-17.
Non-recursiveness of the set of finite sets of equations whose theories are one-based.Douglas D. Smith - 1972 - Notre Dame Journal of Formal Logic 13 (1):135-138.
Decision problems concerning properties of finite sets of equations.Cornelia Kalfa - 1986 - Journal of Symbolic Logic 51 (1):79-87.
Analytics
Added to PP
2009-01-28
Downloads
37 (#422,084)
6 months
4 (#800,606)
2009-01-28
Downloads
37 (#422,084)
6 months
4 (#800,606)
Historical graph of downloads
Citations of this work
Thue trees.Jerzy Marcinkowski & Leszek Pacholski - 2003 - Annals of Pure and Applied Logic 119 (1-3):19-59.
The decision problem for equational bases of algebras.George F. McNulty - 1976 - Annals of Mathematical Logic 10 (3):193.
Universal equational theories and varieties of algebras.Don Pigozzi - 1979 - Annals of Mathematical Logic 17 (1):117.
References found in this work
Model Theory.Michael Makkai, C. C. Chang & H. J. Keisler - 1991 - Journal of Symbolic Logic 56 (3):1096.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Cylindric Algebras. Part I.Leon Henkin, J. Donald Monk, Alfred Tarski, L. Henkin, J. D. Monk & A. Tarski - 1985 - Journal of Symbolic Logic 50 (1):234-237.
Unsolvable problems for equational theories.Peter Perkins - 1967 - Notre Dame Journal of Formal Logic 8 (3):175-185.
George Grätzer. Universal algebra. D. Van Nostrand Company, Inc., Princeton etc. 1968, xvi + 368 pp. [REVIEW]Kirby A. Baker - 1973 - Journal of Symbolic Logic 38 (4):643-644.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo