Categorization systems are widely studied in psychology, sociology, and organization theory as information-structuring devices which are critical to decision-making processes. In the present paper, we introduce a sound and complete epistemic logic of categories and agents' categorical perception. The Kripke-style semantics of this logic is given in terms of data structures based on two domains: one domain representing objects (e.g. market products) and one domain representing the features of the objects which are relevant to the agents' decision-making. We use this framework to discuss and propose logic-based formalizations of some core concepts from psychological, sociological, and organizational research in categorization theory.Comment: In Proceedings TARK 2017, arXiv:1707.0825
We introduce a paraconsistent modal logic $$\mathbf {K}\mathsf {G}^2$$ , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation $$\lnot $$ . We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of $$\mathbf {K}\mathsf {G}^2$$ is two-dimensional: we interpret $$\mathbf {K}\mathsf {G}^2$$ on crisp frames with two valuations $$v_1$$ and $$v_2$$ , connected via $$\lnot $$ , that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that $$\mathbf {K}\mathsf {G}^2$$ is strictly more expressive than the classical modal logic $$\mathbf {K}$$ by proving that finitely branching frames are definable and by establishing a faithful embedding of $$\mathbf {K}$$ into $$\mathbf {K}\mathsf {G}^2$$ . We also construct a constraint tableau calculus for $$\mathbf {K}\mathsf {G}^2$$ over finitely branching frames, establish its decidability and provide a complexity evaluation.