activity
20162025
most citedAlgorithmic correspondence for relevance logics, bunched implication logics, and relation algebras: the algorithm PEARL and its implementation (Technical Report)

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.LOShow all

10 papers · 1 filter

math.LO2024

Modal reduction principles: a parametric shift to graphs

Willem Conradie, Krishna Manoorkar, Alessandra Palmigiano +1

Graph-based frames have been introduced as a logical framework which internalizes an inherent boundary to knowability. They also support the interpretation of lattice-based (modal)…

math.LO2022

Unified inverse correspondence for DLE-Logics

Willem Conradie, Andrea De Domenico, Giuseppe Greco +3

By exploiting the algebraic and order theoretic mechanisms behind Sahlqvist correspondence, the theory of unified correspondence provides powerful tools for correspondence and cano…

math.LO2019

The logic of vague categories

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +2

We introduce a complete many-valued semantics for basic normal lattice-based modal logic. This relational semantics is grounded on many-valued formal contexts from Formal Concept A…

math.LO2019

Modelling competing theories

Willem Conradie, Andrew Craig, Alessandra Palmigiano +1

We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and p…

math.LO2019

Modelling informational entropy

Willem Conradie, Andrew Craig, Alessandra Palmigiano +1

By 'informational entropy', we understand an inherent boundary to knowability, due e.g. to perceptual, theoretical, evidential or linguistic limits. In this paper, we discuss a log…

math.LO2018

Goldblatt-Thomason for LE-logics

Willem Conradie, Alessandra Palmigiano, Apostolos Tzimoulis

We prove a uniform version of the Goldblatt-Thomason theorem for logics algebraically captured by normal lattice expansions (normal LE-logics).