Related papers: Rational Closure in SHIQ
We introduce the logic QKSD which is a normal multi-modal logic over finitely many modalities that additionally supports bounded quantification of modalities. An important feature of this logic is that it allows to quantify over the…
Latent Chain-of-Thought (Latent CoT) models promise efficient reasoning via continuous representations, yet exhibit puzzling performance inconsistencies: excelling at exploration (ProsQA: 97.0%) but failing at computation (GSM8K: 34.1%). We…
We give short, closure-theoretic proofs for uniform bounds on the growth of symbolic powers of ideals in regular rings. The author recently proved these bounds in mixed characteristic using various versions of perfectoid/big Cohen-Macaulay…
A resolution-free definition of rational singularities is introduced, and it is proved that for a variety admitting a resolution of singularities, so in particular in characteristic zero, this is equivalent to the usual definition. It is…
Indexed languages are a classical notion in formal language theory, which has attracted attention in recent decades due to its role in higher-order model checking: They are precisely the languages accepted by order-2 pushdown automata. The…
Description logics (DL) are a family of formal languages for representing and reasoning about structured knowledge in terms of concepts and their relationships. A central reasoning problem in DL is concept subsumption. Although this problem…
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…
Building on the work of \.{I}nan and of Almahariq--Peters--Vergili, we develop an axiomatic framework for approximate algebra based on an algebra-compatible closure operator $\Phi^{\!*}$ on a unital ring. The operator is assumed to be…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but…
We present natural deduction systems and associated modal lambda calculi for the necessity fragments of the normal modal logics K, T, K4, GL and S4. These systems are in the dual-context style: they feature two distinct zones of…
In this paper we present two terminating tableau calculi for propositional Dummett logic obeying the subformula property. The ideas of our calculi rely on the linearly ordered Kripke semantics of Dummett logic. The first calculus works on…
Expressive querying of machine learning models - viewed as a form of intentional data - enables their verification and interpretation using declarative languages, thereby making learned representations of data more accessible. Motivated by…
Let $ {\mathbf k} $ be a field and $Q\in {\mathbf k}[x_1, \ldots, x_s]$ a form (homogeneous polynomial) of degree $d>1.$ The ${\mathbf k}$-Schmidt rank $rk_{\mathbf k}(Q)$ of $Q$ is the minimal $r$ such that $Q= \sum_{i=1}^r R_iS_i$ with…
On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
Let K be a complete, algebraically closed nonarchimedean valued field, and let f(z) in K(z) be a rational function of degree d at least 2. We give an algorithm to determine whether f(z) has potential good reduction over K, based on a…
If $G$ is a finite group, an irreducible complex-valued character $\chi$ is called rational if $\chi(g)$ is rational for all $g\in G$. Also, a conjugacy class $x^G$ is called rational, if for all irreducible complex-valued character $\chi$,…
In principle, explanations are intended as a way to increase trust in machine learning models and are often obligated by regulations. However, many circumstances where these are demanded are adversarial in nature, meaning the involved…
We show that the techniques for resource control that have been developed in the so-called "light logics" can be fruitfully applied also to process algebras. In particular, we present a restriction of Higher-Order pi-calculus inspired by…