3088 varieties a solution to the Ackermann constant problem

Journal of Symbolic Logic 50 (2):487-501 (1985)
  Copy   BIBTEX

Abstract

It is shown that there are exactly six normal DeMorgan monoids generated by the identity element alone. The free DeMorgan monoid with no generators but the identity is characterised and shown to have exactly three thousand and eighty-eight elements. This result solves the "Ackerman constant problem" of describing the structure of sentential constants in the logic R

Categories

Keywords

Reprint years

DOI

10.2307/2274237

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 107,826

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

Sentential constants in systems near R.John Slaney - 1993 - Studia Logica 52 (3):443 - 455.
Locally finite monoids in finitely based varieties.Edmond W. H. Lee - 2019 - Logic Journal of the IGPL 27 (5):743-745.
Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.
Varieties of de Morgan monoids: Covers of atoms.T. Moraschini, J. G. Raftery & J. J. Wannenburg - 2020 - Review of Symbolic Logic 13 (2):338-374.
Classification of Weak De Morgan Algebras.Michiro Kondo - 1995 - Notre Dame Journal of Formal Logic 36 (3):396-406.
Decidability problem for finite Heyting algebras.Katarzyna Idziak & Pawel M. Idziak - 1988 - Journal of Symbolic Logic 53 (3):729-735.
Models of Relevant Arithmetic.John Slaney - 2022 - Australasian Journal of Logic 19 (1).
Four Variables Suffice.Alasdair Urquhart - 2007 - Australasian Journal of Logic 5:66-73.
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable.Robin Hirsch - 2005 - Logic Journal of the IGPL 13 (2):159-171.
Simplified semantics for further relevant logics II: Propositional Constants.Tore Fjetland Øgaard - forthcoming - Logic and Logical Philosophy.

Analytics

Added to PP
2009-01-28

Downloads
69 (#363,259)

6 months
16 (#312,145)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Sentential constants in R and r⌝.Robert K. Meyer - 1986 - Studia Logica 45 (3):301 - 327.
A Pretabular Classical Relevance Logic.Lisa Galminas & John G. Mersch - 2012 - Studia Logica 100 (6):1211-1221.
Sentential constants in systems near R.John Slaney - 1993 - Studia Logica 52 (3):443 - 455.

View all 7 citations / Add more citations

References found in this work

Entailment: The Logic of Relevance and Necessity.[author unknown] - 1975 - Studia Logica 54 (2):261-266.

Add more references