Related papers: Neighbourhood completeness for quantified pretrans…
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
Thirty years ago, Huneke (for local rings) and Lyubeznik (in general) conjectured that for all regular rings $R$, the local cohomology modules $H^i_I(R)$ have finitely many associated prime ideals. We prove substantial new cases of their…
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide…
We study the satisfiability problem for a modal logic expressing knowing-how assertions, which captures an agent's ability to achieve a given goal under the standard semantics based on linear plans. Our main result shows that satisfiability…
We prove that for harmonic quasiconformal mappings $\alpha$-H\"older continuity on the boundary implies $\alpha$-H\"older continuity of the map itself. Our result holds for the class of uniformly perfect bounded domains, in fact we can…
This paper presents the logic QRC$_1$, which is a strictly positive fragment of quantified modal logic. The intended reading of the diamond modality is that of consistency of a formal theory. Predicate symbols are interpreted as…
In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Plo\v{s}\v{c}ica. The standard representations of complete ortholattices and complete perfect Heyting…
The degree of Kripke-incompleteness of a logic $L$ in some lattice $\mathcal{L}$ of logics is the cardinality of logics in $\mathcal{L}$ which share the same class of Kripke-frames with $L$. A celebrated result on Kripke-incompleteness is…
We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of…
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
We introduce Hecke algebras associated to discrete quantum groups with commensurated quantum subgroups. We study their modular properties and the associated Hecke operators. In order to investigate their analytic properties we adapt the…
Let (R; m; k) be a local noetherian domain with field of fractions K and R_v a valuation ring, dominating R (not necessarily birationally). Let v|K be the restriction of v to K; by definition, v|K is centered at R. Let \hat{R} denote the…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
We investigate the computational complexity of the satisfiability problem of modal inclusion logic. We distinguish two variants of the problem: one for the strict and another one for the lax semantics. Both problems turn out to be…
We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As…
For some class of mappings satisfying upper modular estimates with respect to families of curves, a behavior of the corresponding inverse mappings is investigated. In the terms of prime ends, it is proved that, families of such…
In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the L\"{o}b formula $\Box(\Box p\supset…
Recently, many authors have embraced the study of certain properties of modules such as projectivity, injectivity and flatness from an alternative point of view. Rather than saying a module has a certain property or not, each module is…