scientific article; zbMATH DE number 1852922

From MaRDI portal
Publication:4789452

zbMath1003.03518MaRDI QIDQ4789452

J. F. A. K. van Benthem

Publication date: 29 January 2003


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

April the 19thArthur Prior and hybrid logicAlgebraic modal correspondence: Sahlqvist and beyondMixed algebras and their logicsDisentangling structural connectives or life without display propertyAlgorithmic correspondence and canonicity for distributive modal logicTwo-Variable Separation Logic and Its Inner CircleNon-transitive correspondence analysisCounterpart theories for everyonePointfree expression and calculation: From quantification to temporal logicAlgorithmic correspondence for intuitionistic modal mu-calculusThe Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set FormsA quantified coalgebraic van Benthem theoremA semantic hierarchy for intuitionistic logicOn the modal logic of subset and superset: tense logic over Medvedev framesA general framework for FDE-based modal logicsUnnamed ItemCompleteness and correspondence in Chellas-Segerberg semanticsSupervenience, Dependence, DisjunctionAutomated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence AnalysisCOMPLETE ADDITIVITY AND MODAL INCOMPLETENESSDeciding regular grammar logics with converse through first-order logicLogic and Probabilistic UpdateDynamic Epistemic Logic as a Substructural LogicUnnamed ItemReasoning about general preference relationsAlgorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$Application of Urquhart’s Representation of Lattices to Some Non–classical LogicsA unified semantics for a family of modal logics with propositional constants




This page was built for publication: