The following pages link to Willem Conradie (Q409327):
Displayed 45 items.
- Algorithmic correspondence and canonicity for distributive modal logic (Q409328) (← links)
- Algorithmic correspondence for intuitionistic modal mu-calculus (Q483295) (← links)
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- Constructive canonicity for lattice-based fixed point logics (Q1685915) (← links)
- Modelling socio-political competition (Q2035344) (← links)
- Algorithmic correspondence and canonicity for non-distributive logics (Q2273010) (← links)
- Modelling informational entropy (Q2303585) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q2401020) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} (Q2695349) (← links)
- Categories: How I Learned to Stop Worrying and Love Two Sorts (Q2820692) (← links)
- Canonicity results for mu-calculi: an algorithmic approach (Q2983395) (← links)
- On Sahlqvist theory for hybrid logics (Q2983399) (← links)
- Algebraic Semantics for Hybrid Logics (Q3298278) (← links)
- (Q3384065) (← links)
- Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963) (← links)
- Probabilistic Epistemic Updates on Algebras (Q3457689) (← links)
- IV. Semantic extensions of SQEMA (Q3643312) (← links)
- On the strength and scope of DLS (Q3647241) (← links)
- (Q4580322) (← links)
- (Q4625704) (← links)
- Probabilistic Epistemic Updates on Algebras (Q4972163) (← links)
- Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA (Q4982120) (← links)
- (Q4999269) (← links)
- Non-distributive logics: from semantics to meaning (Q5004948) (← links)
- Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233) (← links)
- (Q5109523) (← links)
- (Q5119388) (← links)
- An algebraic look at filtrations in modal logic (Q5176659) (← links)
- Unified Correspondence (Q5249695) (← links)
- (Q5253278) (← links)
- Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (Q5310652) (← links)
- (Q5324584) (← links)
- Analogues of Bull’s theorem for hybrid logic (Q5382581) (← links)
- (Q5483000) (← links)
- Rough concepts (Q6081075) (← links)
- Fuzzy Halpern and Shoham's interval temporal logics (Q6083148) (← links)
- Sahlqvist via Translation (Q6271901) (← links)
- Constructive Canonicity of Inductive Inequalities (Q6271910) (← links)
- Algebraic modal correspondence: Sahlqvist and beyond (Q6274851) (← links)
- Goldblatt-Thomason for LE-logics (Q6307078) (← links)
- Modelling informational entropy (Q6316405) (← links)
- Modelling competing theories (Q6319493) (← links)
- The logic of vague categories (Q6323613) (← links)
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras: the algorithm PEARL and its implementation (Technical Report) (Q6375255) (← links)
- Unified inverse correspondence for DLE-Logics (Q6393952) (← links)