- 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
Finite Basis Problem for Semigroups of Order Five or Less: Generalization and Revisitation
Studia Logica 101 (1):95-115 (2013)
Abstract
A system of semigroup identities is hereditarily finitely based if it defines a variety all semigroups of which are finitely based. Two new types of hereditarily finitely based identity systems are presented. Two of these systems, together with eight existing systems, establish the hereditary finite basis property of every semigroup of order five or less with one possible exceptionMy notes
Similar books and articles
Finite basis theorem for Filter-distributive protoalgebraic deductive systems and strict universal horn classes.Katarzyna Pałasińska - 2003 - Studia Logica 74 (1-2):233 - 273.
The existence of finitely based lower covers for finitely based equational theories.Jaroslav Ježek & George F. McNulty - 1995 - Journal of Symbolic Logic 60 (4):1242-1250.
Equational bases for joins of residuated-lattice varieties.Nikolaos Galatos - 2004 - Studia Logica 76 (2):227 - 240.
The model theory of finitely generated finite-by-Abelian groups.Francis Oger - 1984 - Journal of Symbolic Logic 49 (4):1115-1124.
A non-finitely based quasi-variety of de Morgan algebras.Hernando Gaitán & Milton H. Perea - 2004 - Studia Logica 78 (1-2):237 - 248.
Finite basis problems and results for quasivarieties.Miklós Maróti & Ralph McKenzie - 2004 - Studia Logica 78 (1-2):293 - 320.
Axiom systems for first order logic with finitely many variables.James S. Johnson - 1973 - Journal of Symbolic Logic 38 (4):576-578.
Not every "tabular" predicate logic is finitely axiomatizable.Dmitrij Skvortsov - 1997 - Studia Logica 59 (3):387-396.
Axiomatizing logics closely related to varieties.W. Rautenberg - 1991 - Studia Logica 50 (3-4):607 - 622.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable.Valentin Shehtman - 1990 - Studia Logica 49 (3):365 - 385.
Concerning axiomatizability of the quasivariety generated by a finite Heyting or topological Boolean algebra.Wles?aw Dziobiak - 1982 - Studia Logica 41 (4):415 - 428.
Analytics
Added to PP
2012-06-12
Downloads
16 (#880,136)
6 months
3 (#1,023,809)
2012-06-12
Downloads
16 (#880,136)
6 months
3 (#1,023,809)
Historical graph of downloads
References found in this work
Equational Logic and Equational Theories of Algebras.A. Tarski, H. Arnold Schmidt & K. Schutte - 1971 - Journal of Symbolic Logic 36 (1):161-162.
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-pp8v9 uwo