Similarity triangle logic
| Autor: | Saeide Zahiri, Arsham Borumand Saeid |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
0209 industrial biotechnology
Class (set theory) 02 engineering and technology Computer Science::Computational Geometry Theoretical Computer Science Combinatorics 020901 industrial engineering & automation Similarity (network science) Conservative extension Binary operation TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Completeness (order theory) ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Geometry and Topology Gödel's completeness theorem Variety (universal algebra) Algebra over a field Software MathematicsofComputing_DISCRETEMATHEMATICS ComputingMethodologies_COMPUTERGRAPHICS Mathematics |
| Zdroj: | Soft Computing. 25:6841-6849 |
| ISSN: | 1433-7479 1432-7643 |
| Popis: | The present study aimed to propose the similarity triangle algebra and prove the completeness of the similarity triangle logic. The similarity was defined on triangle algebra. Similarity triangle algebra is a triangle algebra endowed with a binary operation S, which verifies specific additional properties. These properties and a class of all the similarity triangle algebras form a variety which were assessed as well. In addition, the similarity IVRL-filters (S-IVRL-filters) were investigated and introduced in the similarity triangle algebras, and the similarity triangle logic $$(\mathcal {STL})$$ was presented, which is a system of several-valued logic capturing the tautologies of similarity triangle algebras to prove the completeness theorem. According to the results, $$\mathcal {STL}$$ is a conservative extension of triangle logic ( $$\mathcal {TL}$$ ). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink