A note on negation: a PCS-Completion of semilattices

Authors:
Léonard Kwuida
Affiliations:
Mathematisches Institut, Universität Bern, Bern
Venue:
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Year:
2006

Citing 7
Cited 0

Finite pseudocomplemented lattices and “permutoedre”

Discrete Mathematics
A logic for rough sets

Theoretical Computer Science
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Contextual Attribute Logic

ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
Boolean Concept Logic

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
An Investigation of the Laws of Thought

An Investigation of the Laws of Thought
Which concept lattices are pseudocomplemented?

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the paper “Which concept lattices are pseudocomplemented?” ([GK05]) we gave a contextual characterization of pseudocomplemented concept lattices by means of the arrow relations. In this contribution we use this description to embed finite semilattices into pseudocomplemented semilattices. This process can be used to define a negation on concepts. AMS Subject Classification: 06D15, 68T30.