A note on chain‐based semi‐Heyting algebras

Mathematical Logic Quarterly 66 (4):409-417 (2020)
  Copy   BIBTEX

Abstract

We determine the number of non‐isomorphic semi‐Heyting algebras on an n‐element chain, where n is a positive integer, using a recursive method. We then prove that the numbers obtained agree with those determined in [1]. We apply the formula to calculate the number of non‐isomorphic semi‐Heyting chains of a given size in some important subvarieties of the variety of semi‐Heyting algebras that were introduced in [5]. We further exploit this recursive method to calculate the numbers of non‐isomorphic semi‐Heyting chains with n elements such that removing the mth element () we are left with a subalgebra. We also solve a related problem posed in [1] of determining the number of ways a semi‐Heyting chain with elements can be extended to a n element semi‐Heyting chain by adding a new element in the mth place. Finally we combine these results by finding a second way to calculate the numbers that provides some extra information.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,685

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Semi Heyting–Brouwer Logic.Juan Manuel Cornejo - 2015 - Studia Logica 103 (4):853-875.
Semi-intuitionistic Logic.Juan Manuel Cornejo - 2011 - Studia Logica 98 (1-2):9-25.

Analytics

Added to PP
2021-01-17

Downloads
7 (#1,189,630)

6 months
4 (#313,042)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.

Add more references