activity
20062025
most citedAlgorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA

93 citations · 212 across the 18 of their papers we have counts for

collaborators

25 papers

cs.LO2025

Questions as cognitive filters

Willem Conradie, Krishna Manoorkar, Alessandra Palmigiano +2

In this paper, we develop a logico-algebraic framework for modeling decision-making through deliberation in multi-agent settings. The central concept in this framework is that of i…

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…

cs.LO2022

Modal reduction principles across relational semantics

Willem Conradie, Andrea De Domenico, Krishna Manoorkar +4

The present paper establishes systematic connections among the first-order correspondents of Sahlqvist modal reduction principles in various relational semantic settings which incl…

cs.LO2021★ 1 cited

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

Willem Conradie, Valntin Goranko, Peter Jipsen

The non-deterministic algorithmic procedure PEARL (an acronym for `Propositional variables Elimination Algorithm for Relevance Logic') has been recently developed for computing fir…

math.LO2020★ 6 cited

Non-distributive logics: from semantics to meaning

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +1

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual charact…

math.LO2019★ 9 cited

Modelling socio-political competition

Willem Conradie, Alessandra Palmigiano, Claudette Robinson +2

This paper continues the investigation of the logic of competing theories, be they scientific, social, political etc. We introduce a many-valued, multi-type modal language which we…

math.LO2019★ 2 cited

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…

cs.LO2019★ 26 cited

Rough concepts

Willem Conradie, Sabine Frittella, Krishna Manoorkar +4

The present paper proposes a novel way to unify Rough Set Theory and Formal Concept Analysis. Our method stems from results and insights developed in the algebraic theory of modal…

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★ 9 cited

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).

cs.LO2018

An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part II)

Willem Conradie, Salih Durhan, Guido Sciavicco

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points a…

cs.LO2018

An Integrated First-Order Theory of Points and Intervals over Linear Orders (Part I)

Willem Conradie, Salih Durhan, Guido Sciavicco

There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points a…

math.LO2016

Probabilistic Epistemic Updates on Algebras

Willem Conradie, Sabine Frittella, Alessandra Palmigiano +2

The present paper contributes to the development of the mathematical theory of epistemic updates using the tools of duality theory. Here we focus on Probabilistic Dynamic Epistemic…

math.LO2016

Algebraic modal correspondence: Sahlqvist and beyond

Willem Conradie, Alessandra Palmigiano, Sumit Sourabh

The present paper proposes a new introductory treatment of the very well known Sahlqvist correspondence theory for classical modal logic. The first motivation for the present treat…

math.LO2016

Algebraic semantics for hybrid logics

Willem Conradie, Claudette Robinson

We introduce hybrid algebras as algebraic semantics for hybrid languages with nominals and, possibly, the satisfaction operator. We establish a duality between hybrid algebras and…

math.LO2016

Algorithmic correspondence and canonicity for non-distributive logics

Willem Conradie, Alessandra Palmigiano

We extend the theory of unified correspondence to a very broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as `lattic…

math.LO2016

Categories: How I Learned to Stop Worrying and Love Two Sorts

Willem Conradie, Sabine Frittella, Michele Piazzai +3

RS-frames were introduced by Gehrke as relational semantics for substructural logics. They are two-sorted structures, based on RS-polarities with additional relations used to inter…

math.LO2016★ 12 cited

Constructive canonicity for lattice-based fixed point logics

Willem Conradie, Andrew Craig, Alessandra Palmigiano +1

We prove the algorithmic canonicity of two classes of -inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie a…

math.LO2016★ 18 cited

Constructive Canonicity of Inductive Inequalities

Willem Conradie, Alessandra Palmigiano

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions.…

math.LO2016★ 22 cited

Sahlqvist via Translation

Willem Conradie, Alessandra Palmigiano, Zhiguang Zhao

In recent years, unified correspondence has been developed as a generalized Sahlqvist theory which applies uniformly to all signatures of normal and regular (distributive) lattice…

cs.LO2015★ 14 cited

Canonicity and Relativized Canonicity via Pseudo-Correspondence: an Application of ALBA

Willem Conradie, Alessandra Palmigiano, Sumit Sourabh +1

We generalize Venema's result on the canonicity of the additivity of positive terms, from classical modal logic to a vast class of logics the algebraic semantics of which is given…

math.LO2014

Canonicity results for mu-calculi: an algorithmic approach

Willem Conradie, Andrew Craig

We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward.…