Related papers: Valuations in Nilpotent Minimum Logic

We introduce Value Coalition Logic, a typed assignment-based reconstruction of classical coalition logic. The strategic semantics is unchanged: coalitional ability is still interpreted by the standard one-step game-form clause. The change…

Fluids can behave in a highly irregular, turbulent way. It has long been realised that, therefore, some weak notion of solution is required when studying the fundamental partial differential equations of fluid dynamics, such as the…

We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…

We compute the compactly supported Euler characteristic of the space of degree $d$ irreducible polynomials in $n$ variables with real coefficients and show that the values are given by the digits in the so-called balanced binary expansion…

We introduce the universal Euler characteristic of orbit space definable groupoids, a class of groupoids containing cocompact proper Lie groupoids as well as translation groupoids associated to proper definable group actions. We show that…

One of the main reasons to employ a description logic such as EL or EL++ is the fact that it has efficient, polynomial-time algorithmic properties such as deciding consistency and inferring subsumption. However, simply by adding negation of…

In [Ban97] a connection among rough sets (in particular, pre-rough algebras) and three-valued {\L}ukasiewicz logic {\L}3 is pointed out. In this paper we present a temporal like semantics for Nilpotent Minimum logic NM ([Fod95, EG01]), in…

Because of the pervasive usage of Neural Networks in human sensitive applications, their interpretability is becoming an increasingly important topic in machine learning. In this work we introduce a simple way to interpret the output…

For a finitely presented discrete group $\Gamma$, we introduce two generalizations of the orbifold Euler characteristic and $\Gamma$-orbifold Euler characteristic to a class of proper topological groupoids large enough to include all…

The notion of quantized characters is introduced in our previous paper as a natural quantization of characters in the context of asymptotic representation theory for compact quantum groups. As in the case of ordinary groups, the…

Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such as of the lambda-binder of the lambda-calculus…

We present some results, both rigorously mathematical and computational, showing unexpected relations between different identities expressing nilpotence in nonassociative algebras, and formulate a number of conjectural generalizations and…

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…

We compute the Euler characteristics of tautological vector bundles and their exterior powers over the Quot schemes of curves. We give closed-form expressions over punctual Quot schemes in all genera. For higher rank quotients of a trivial…

The main objective of this paper is to study the relationship between a solvable evolution algebra and its subalgebra lattice, emphasizing two of its main properties: distributivity and modularity. First, we will focus on the nilpotent…

We extend the notion of variational integrator for classical Euler-Lagrange equations to the fractional ones. As in the classical case, we prove that the variational integrator allows to preserve Noether-type results at the discrete level.

This work explores the integration of ontology-based reasoning and Machine Learning techniques for explainable value classification. By relying on an ontological formalization of moral values as in the Moral Foundations Theory, relying on…

All non-negative, continuous, $\operatorname{SL}(n)$ and translation invariant valuations on the space of super-coercive, convex functions on $\mathbb{R}^n$ are classified. Furthermore, using the invariance of the function space under the…