Related papers: On partitioning Kripke frames of finite height
A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
Finite (word) state transducers extend finite state automata by defining a binary relation over finite words, called rational relation. If the rational relation is the graph of a function, this function is said to be rational. The class of…
In this paper we demonstrate decidability for the intuitionistic modal logic S4 first formulated by Fischer Servi. This solves a problem that has been open for almost thirty years since it had been posed in Simpson's PhD thesis in 1994. We…
This is the first of a series of papers on stack representation of finitely presented Heyting pretoposes. In this paper, we provide the first step by constructing a (2, 1)-site, which can be thought of as the site of finite Kripke frames,…
We further develop the paraconsistent G\"{o}del modal logic. In this paper, we consider its version endowed with Kripke semantics on $[0,1]$-valued frames with two fuzzy relations $R^+$ and $R^-$ (degrees of trust in assertions and denials)…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…
This paper provides a general characterization of preferences that admit a Richter-Peleg representation without imposing completeness or transitivity. We establish that a binary relation on a nonempty set admits a Richter-Peleg…
We show that the category of graded modules over a finite-dimensional graded algebra admitting a triangular decomposition can be endowed with the structure of a highest weight category. When the algebra is self-injective, we show…
Silting modules are abundant. Indeed, they parametrise the definable torsion classes over a noetherian ring, and the hereditary torsion pairs of finite type over a commutative ring. Also the universal localisations of a hereditary ring, or…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
The modular properties of fractional level affine sl(2)-theories and, in particular, the application of the Verlinde formula, have a long and checkered history in conformal field theory. Recent advances in logarithmic conformal field theory…
Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete…
It is a long-standing open problem whether modal logics of the form $\mathbf{K} \oplus \Box^n p \to \Box^m p$ for $n>m>1$ have the finite model property (FMP). We solve this by showing that any modal logic axiomatized by formulas of the…
We study the satisfiability problem for the fluted fragment extended with transitive relations. The logic enjoys the finite model property when only one transitive relation is available and the finite model property is lost when…
Let k be an algebraically closed field of characteristic p>0. We compute the Weyl filtration multiplicities in indecomposable tilting modules and the decomposition numbers for the general linear group over k in terms of cap diagrams under…