Related papers: Epstein Semantics: Characterization, Interpolation…
We establish various complexity results for the entailment problem between formulas in Separation Logic with user-defined predicates denoting recursive data structures. The considered fragments are characterized by syntactic conditions on…
In this article, we consider some generalizations of polynomial and exponential B-splines. Firstly, the extension from integral to complex orders is reviewed and presented. The second generalization involves the construction of uncountable…
This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…
Benchmarks for the evaluation of model performance play an important role in machine learning. However, there is no established way to describe and create new benchmarks. What is more, the most common benchmarks use performance measures…
We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…
The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…
This paper presents a novel possible worlds semantics, designed to elucidate the underpinnings of ultrafinitism. By constructing a careful modification of the well-known Kripke models for inuitionistic logic, we seek to extend our…
We study logic for reasoning with if-then formulas describing dependencies between attributes of objects which are observed in consecutive points in time. We introduce semantic entailment of the formulas, show its fixed-point…
In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…
We provide a general and syntactically-defined family of sequent calculi, called \emph{semi-analytic}, to formalize the informal notion of a "nice" sequent calculus. We show that any sufficiently strong (multimodal) substructural logic with…
The modal systems S1--S3 were introduced by C. I. Lewis as logics for strict implication. While there are Kripke semantics for S2 and S3, there is no known natural semantics for S1. We extend S1 by a Substitution Principle SP which…
This paper establishes and proves complexity results for entailment for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. As recently shown, cumulative logics are famously characterised by…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
In this paper, we tell a story about incompleteness in modal logic. The story weaves together a paper of van Benthem, `Syntactic aspects of modal incompleteness theorems,' and a longstanding open question: whether every normal modal logic…
Knowledge graphs (KGs) have become valuable knowledge resources in various applications, and knowledge graph embedding (KGE) methods have garnered increasing attention in recent years. However, conventional KGE methods still face challenges…
The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…
We combine the concepts of modal logics and many-valued logics in a general and comprehensive way. Namely, given any finite linearly ordered set of truth values and any set of propositional connectives defined by truth tables, we define the…
We study structural aspects of randomized parameterized computation. We introduce a new class ${\sf W[P]}$-${\sf PFPT}$ as a natural parameterized analogue of ${\sf PP}$. Our definition uses the machine based characterization of the…
None of the first-order modal logics between $\mathsf{K}$ and $\mathsf{S5}$ under the constant domain semantics enjoys Craig interpolation or projective Beth definability, even in the language restricted to a single individual variable. It…
In this paper we study the representation theory of filtered algebras with commutative associated graded whose spectrum has finitely many symplectic leaves. Examples are provided by the algebras of global sections of quantizations of…