English
Related papers

Related papers: Valuations in Nilpotent Minimum Logic

200 papers

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

Computational Geometry · Computer Science 2011-12-21 Bjarke Hammersholt Roune , Eduardo Sáenz de Cabezón

In this paper we introduce and study the Euler characteristic associated with algebraic modules generated by arbitrary elements of certain noncommutative polyballs. We provide several asymptotic formulas and prove some of its basic…

Functional Analysis · Mathematics 2014-12-05 Gelu Popescu

The Euler characteristic is the only additive topological invariant for spaces of certain sort, in particular, for manifolds with some finiteness properties. A generalization of the notion of a manifold is the notion of a V-manifold. Here…

Geometric Topology · Mathematics 2018-04-27 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernández

In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…

Logic · Mathematics 2009-06-12 Bernd R. Schuh

We introduce $\mathcal{DLR}^+$, an extension of the n-ary propositionally closed description logic $\mathcal{DLR}$ to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local…

Artificial Intelligence · Computer Science 2017-07-27 Alessandro Artale , Enrico Franconi , Rafael Peñaloza , Francesco Sportelli

We develop an extension of valuations theorem for suitable extensions of idempotent semirings. As an application, we give a new proof for the classical case of fields. Along the way, we develop characteristic one analogues of some central…

Rings and Algebras · Mathematics 2016-08-23 Jeffrey Tolliver

The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…

Number Theory · Mathematics 2023-09-06 Juan Hernandez-Toro

The Euler characteristic of a semialgebraic set can be considered as a generalization of the cardinality of a finite set. An advantage of semialgebraic sets is that we can define "negative sets" to be the sets with negative Euler…

Combinatorics · Mathematics 2018-09-17 Takahiro Hasebe , Toshinori Miyatani , Masahiko Yoshinaga

The paper is devoted to the study of finite dimensional complex evolution algebras. The class of evolution algebras isomorphic to evolution algebras with Jordan form matrices is described. For finite dimensional complex evolution algebras…

Commutative Algebra · Mathematics 2018-05-01 L. M. Camacho , J. R. Gómez , B. A. Omirov , R. M. Turdibaev

We define lifting properties for universal algebras, which we study in this general context and then particularize to various such properties in certain classes of algebras. Next we focus on residuated lattices, in which we investigate…

Logic · Mathematics 2016-08-14 Daniela Cheptea , George Georgescu , Claudia Mureşan

Using the weak factorization theorem we give a simple presentation for the value group of the universal Euler characteristic with compact support for varieties of characteristic zero and describe the value group of the universal Euler…

Algebraic Geometry · Mathematics 2007-05-23 Franziska Bittner

The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…

High Energy Physics - Theory · Physics 2008-11-26 J. A. Mulvey

A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…

Logic · Mathematics 2024-01-23 Michele Pra Baldi , Adam Přenosil

The paper concerns an analogue of the famous Schur multiplier in the context of associative algebras and a measure of how far its dimension is from being maximal. Applying a methodology from Lie theory, we characterize all…

Rings and Algebras · Mathematics 2023-02-06 Erik Mainellis

We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic. We consider semantic characterizations of definability, as…

Logic in Computer Science · Computer Science 2023-06-22 Michael Benedikt , Pierre Bourhis , Michael Vanden Boom

In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong…

Logic in Computer Science · Computer Science 2017-07-14 Valentina Castiglioni , Simone Tini

It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of non-orthomodular and thus non-distributive lattices that properly contain standard orthomodular and Boolean classes,…

Logic in Computer Science · Computer Science 2008-12-17 Mladen Pavicic , Norman D. Megill

In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…

Geometric Topology · Mathematics 2007-05-23 Mikio Furuta

This paper provides the theory of integration with respect to Euler characteristics of finite categories. As an application, we use sensors to enumerate the targets lying on a poset. This is a discrete analogue to Baryshnikov and Ghrist's…

Combinatorics · Mathematics 2015-08-18 Kohei Tanaka

We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning). Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a…