Related papers: Beth Definability in the Logic KR
In this paper syntactic objects---concept constructors called part restrictions which realize rational grading are considered in Description Logics (DLs). Being able to convey statements about a rational part of a set of successors, part…
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
Model theoretic results such as Characterization and Definability give important information about different logics. It is well known that the proofs of those results for several modal logics have, somehow, the same 'taste'. A general proof…
Categorical models of the exponential modality of linear logic will often, but not always, support an operation of differentiation. When they do, we speak of a monoidal differential modality; when they do not, we have merely a monoidal…
We prove that the finiteness of a finitely generated category of irreducible algebraic varieties over a field of characteristic zero is decidable. We also obtain a Burnside finiteness criterion for such a category, with applications to…
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…
We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…
The Kuchar observables notion is shown to apply only to a limited range of theories. Relational mechanics, slightly inhomogeneous cosmology and supergravity are used as examples that require further notions of observables. A suitably…
Metric Temporal Logic, $\mtlfull$ is amongst the most studied real-time logics. It exhibits considerable diversity in expressiveness and decidability properties based on the permitted set of modalities and the nature of time interval…
A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always…
We characterize the expressive power of description logic (DL) TBoxes, both for expressive DLs such as ALC and ALCQIO and lightweight DLs such as DL-Lite and EL. Our characterizations are relative to first-order logic, based on a wide range…
The affinization morphism for the stack $\mathfrak{M}(\Pi_Q)$ of representations of a preprojective algebra $\Pi_Q$ is a local model for the morphism from the stack of objects in a general 2-Calabi-Yau category to the good moduli space. We…
In his article "A discrete form of the theorem that each field endomorphism of $\mathbb{R}$ ($\mathbb{Q}_p$) is the identity", Tyszka introduce a logical property which is equivalent to algebraicity in $\mathbb{R}$ and in $\mathbb{Q}_p$.…
We consider the bimodal language, where the first modality is interpreted by a binary relation in the standard way, and the second is interpreted by the relation of inequality. It follows from Hughes (1990), that in this language,…
We introduce a novel variant of logical relations that maps types not merely to partial equivalence relations on values, as is commonly done, but rather to a proof-relevant generalisation thereof, namely setoids. The objects of a setoid…
A recent result has demonstrated that the Bethe partition function always lower bounds the true partition function of binary, log-supermodular graphical models. We demonstrate that these results can be extended to other interesting classes…
Given a definable function $f: S \to \mathbb{R}$ on a definable set $S$, we study sublevel sets of the form $S^f_t \coloneqq \{x \in S: f(x) \leq t\}$ for all $t \in \mathbb{R}$. Using o-minimal structures, we prove that the Euler…
To each skew-gentle algebra, one can assign a gentle algebra in terms of combinatorial data. In order to relate the structures of the two algebras, we establish a homological epimorphism and a recollement of derived module categories. This…
W. A. Moens proved that a Lie algebra is nilpotent if and only if it admits an invertible Leibniz-derivation. In this paper we show that with the definition of Leibniz-derivation from W. A. Moens the similar result for non Lie Leibniz…
We show that the following two algebras are isomorphic. The first is the algebra $A_P$ of functions on the scheme of monic linear second-order differential operators on $\C$ with prescribed regular singular points at $z_1,..., z_n, \infty$,…