activity
20122026
most citedSahlqvist theory for impossible worlds

36 citations · 57 across the 6 of their papers we have counts for

collaborators

7 papers

cs.LG2026

Amortized Interventional Forecasting for Multivariate CIR Processes

Andreas Sauter, Sumit Sourabh, Drona Kandhai +1

Mean-reverting dynamics are pervasive in finance, and the Cox--Ingersoll--Ross (CIR) process is a standard model for the time series they produce, from short rates to credit defaul…

cs.CE2023

Network characteristics of financial networks

M. Boersma, S. Sourabh, L. A. Hoogduin +1

We embrace a fresh perspective to auditing by analyzing a large set of companies as complex financial networks rather than static aggregates of balance sheet data. Preliminary anal…

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

Sahlqvist theory for impossible worlds

Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao

We extend unified correspondence theory to Kripke frames with impossible worlds and their associated regular modal logics. These are logics the modal connectives of which are not r…

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…

cs.LO2014★ 7 cited

Generalized Vietoris Bisimulations

Sebastian Enqvist, Sumit Sourabh

We introduce and study bisimulations for coalgebras on Stone spaces [14]. Our notion of bisimulation is sound and complete for behavioural equivalence, and generalizes Vietoris bis…

cs.MA2012

Characterizing Successful Formulas: the Multi-agent Case

Sanchit Saraf, Sumit Sourabh

Characterization of successful formulas in Public Announcement Logic (PAL) is a well known open problem in Dynamic Epistemic Logic. Recently, Holliday and ICard have given a comple…