Related papers: Abstraction Principles and the Classification of S…
The article develops a parametric model of fairness called "$\varepsilon$-fairness" that can be represented using a single second-order cone constraint and incorporated into existing decision-making problem formulations without impacting…
We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…
Recent studies strive to incorporate various human rationales into neural networks to improve model performance, but few pay attention to the quality of the rationales. Most existing methods distribute their models' focus to…
A new approach is established to computing the image of a rational map, whereby the use of approximation complexes is complemented with a detailed analysis of the torsion of the symmetric algebra in certain degrees. In the case the map is…
Graded contractions of certain non-toral $\mathbb{Z}_2^3$-gradings on the simple Lie algebras $\mathfrak{so}(7,\mathbb C)$ and $\f{so}(8,\mathbb C)$ are classified up to two notions of equivalence. In particular, there arise two large…
The purpose of this work is to complete the algebraic foundations of second-order languages from the viewpoint of categorical algebra as developed by Lawvere. To this end, this paper introduces the notion of second-order algebraic theory…
Euclid uses an undefined notion of "equal figures", to which he applies the common notions about equals added to equals or subtracted from equals. When (in previous work) we formalized Euclid Book~I for computer proof-checking, we had to…
We look at equivalence relations on the set of models of a theory -- MERs, for short -- such that the class of equivalent pairs is itself an elementary class, in a language appropriate for pairs of models. We provide many examples of…
Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to the theorem in some sense. For example, in the Watson…
This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas…
We apply, in the context of semigroups, the main theorem from~\cite{higjac} that an elementary class $\mathcal{C}$ of algebras which is closed under the taking of direct products and homomorphic images is defined by systems of equations. We…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
Based on concepts like kth convex hull and finer characterization of nonconvexity of a function, we propose a refinement of the Shapley-Folkman lemma and derive a new estimate for the duality gap of nonconvex optimization problems with…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
Two types of higher order Lie $\ell$-ple systems are introduced in this paper. They are defined by brackets with $\ell > 3$ arguments satisfying certain conditions, and generalize the well known Lie triple systems. One of the…
Attribution-based explanation techniques capture key patterns to enhance visual interpretability; however, these patterns often lack the granularity needed for insight in fine-grained tasks, particularly in cases of model misclassification,…
We formulate a well-posedness and approximation theory for a class of generalised saddle point problems with a specific form of constraints. In this way we develop an approach to a class of fourth order elliptic partial differential…
We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…