Sheffer stroke operation on L-algebras via an algorithmic approach

In this study, we introduce the Sheffer stroke L-algebra and prove some fundamental theorems, propositions and lemmas of Sheffer Stroke L-algebras. The notions of filter and ultrafilter for Sheffer stroke L-algebra are studied. We give subalgebra and normal subset definitions of a Sheffer stroke L-a...

Full description

Saved in:
Bibliographic Details
Published inSoft computing (Berlin, Germany) Vol. 28; no. 19; pp. 10801 - 10813
Main Authors Gürsoy, Necla Kırcalı, Öner, Tahsin, Gürsoy, Arif, Ülker, Alper
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2024
Springer Nature B.V
Subjects
Algebra
Algebraic
Algorithms
Analytical Methods in Soft Computing
Artificial Intelligence
Boolean
Computational Intelligence
Control
Engineering
Foundation
Homomorphisms
Isomorphism
Logic
Mathematical Logic and Foundations
Mechatronics
Robotics
Set theory
Theorems
Online AccessGet full text
ISSN1432-7643
1433-7479
DOI10.1007/s00500-024-09906-6

Cover

More Information
Summary:In this study, we introduce the Sheffer stroke L-algebra and prove some fundamental theorems, propositions and lemmas of Sheffer Stroke L-algebras. The notions of filter and ultrafilter for Sheffer stroke L-algebra are studied. We give subalgebra and normal subset definitions of a Sheffer stroke L-algebras. Moreover, a homomorphism between Sheffer stroke L-algebras is introduced and isomorphism theorems are presented. Finally, we give three new algorithms for Sheffer stroke L-algebras. Thus, it is contributed to researchers on different application areas by presenting an algorithmic approach on this subject, for the first time in the literature.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-7643
1433-7479
DOI:10.1007/s00500-024-09906-6