Related papers: Relational Semantics for the Turing Schmerl Calcul…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…
The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to…
We study two notions of definability for classes of relational structures based on modal extensions of {\L}ukasiewicz finitely valued-logics. The main results of the paper are the equivalent of the Goldblatt - Thomason theorem for these…
We establish a generic upper bound ExpTime for reasoning with global assumptions (also known as TBoxes) in coalgebraic modal logics. Unlike earlier results of this kind, our bound does not require a tractable set of tableau rules for the…
For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…
In this paper, we study a new Kripke-style semantics for classical modal logic, named as provability models. We study provability models for the propositional modal logics K, K4, S4 GL, GLP and the interpretability logic ILM. Provability…
We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…
LTL3 is a multi-valued variant of Linear-time Temporal Logic for runtime verification applications. The semantic descriptions of LTL3 in previous work are given only in terms of the relationship to conventional LTL. Our approach, by…
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 endow with relational semantics based on enriched reflexive…
A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
Conceptual models rely on structural information to describe relationships among UML classes; among these, the whole-part (WP) relationship plays a fundamental role. This paper explores and analyzes the WP semantics at large with a focus on…
Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…
It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We revisit Goldin, Smolka hypothesis that persistent Turing machine (PTM) can capture the intuitive notion of sequential interaction computation.…
We prove a version of the Gr\"atzer-Schmidt theorem for the Lindenbaum-Tarski algebra associated to the Implicational Propositional Calculus.
We study provability predicates $\mathrm{Pr}_T(x)$ satisfying the following condition $\mathbf{E}$ from a modal logical perspective: $\mathbf{E}:$ if $ T \vdash \varphi \leftrightarrow \psi$, then $T \vdash \mathrm{Pr}_T(\ulcorner \varphi…
Mechanized verification of liveness properties for infinite programs with effects and nondeterminism is challenging. Existing temporal reasoning frameworks operate at the level of models such as traces and automata. Reasoning happens at a…
This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. Given imprecise information represented by probability bounds and conditional…
We find new "reasons" for a class of models for not having a universal model in a cardinal $\lambda$. This work, though it has consequences in model theory, is really in combinatorial set theory. We concentrate on a prototypical class which…