2008•Unpublished venueRequires access

Logical Connectives for Granular Computing

Erich Peter Klement, Radko Mesiar, Andrea Mesiarová‐Zemánková, Susanne Saminger‐Platz

Abstract

This chapter contains sections titled: Introduction Conjunction Operators on Bounded Lattices and Related Logical Operators Logical Connectives on Finite Chains Logical Connectives on Closed Intervals Logical Connectives on Infinite Discrete Chains Logical Connectives on Interval-Valued Truth-Value Lattices Logical Connectives on Other Lattices of Truth-Values Conclusion Acknowledgments References

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Logical connective, Truth function, Truth value, Truth table, Non-classical logic, Logical conjunction, Conjunction (astronomy), Mathematics