Related papers: Regular entailment relations
In this paper we develop an algorithm for obtaining some new linear relations among the Lauricella $F_D$ functions. Relations we obtain, generalize those hinted in the work of B. C. Carlson. The coefficients of these relations are contained…
Research on summarization has mainly been driven by empirical approaches, crafting systems to perform well on standard datasets with the notion of information Importance remaining latent. We argue that establishing theoretical models of…
In a previous paper we exhibited the somewhat surprising property that most direct links of prime ideals in Gorenstein rings are equimultiple ideals with reduction number $1$. This led to the construction of large families of…
We propose and analyze a regularization approach for structured prediction problems. We characterize a large class of loss functions that allows to naturally embed structured outputs in a linear space. We exploit this fact to design…
One approach to studying the dynamics of a singular Lagrangian system is to attempt to regularize it, that is, to find an equivalent and regular system. In the case of time-independent singular Lagrangians, an approach due to \textit{A.…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
We introduce the notion of cylinder of a relation in the context of posets, extending the construction of the mapping cylinder. We establish a local-to-global result for relations, generalizing Quillen's Theorem A for order preserving maps,…
Motivated by the splitting principle, we define certain simplicial complexes associated to an associative ring $A$, which have an action of the general linear group $GL(A)$. This leads to an exact sequence, involving Quillen's algebraic…
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
A classical theorem due to Quillen (1969) identifies the unitary bordism ring with the Lazard ring, which classifies the universal one-dimensional commutative formal group law. We prove an equivariant generalization of this result by…
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a $k$-valued transducer into $k$ unambiguous functional ones, a result established by A. Weber in 1996. Our construction is based on a…
We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…
We give an interpretation of the cohomology of an arithmetically defined group as a set of equivalence classes of lattices. We use this interpretation to give a simpler proof of the connection established by J. Rohlfs between genus and…
Explanation regularisation (ER) has been introduced as a way to guide text classifiers to form their predictions relying on input tokens that humans consider plausible. This is achieved by introducing an auxiliary explanation loss that…
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…