Related papers: Algebraic Notions of Termination
We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…
The paper is an overview of recent results on algebraic structures (semigroups, groupoids, algebras, inverse semigroups, and groups) associated with objects with a rich set of partial symmetries. We discuss etale groupoids and inverse…
We study the problem of whether a given finite algebra with finitely many basic operations contains a cube term; we give both structural and algorithmic results. We show that if such an algebra has a cube term then it has a cube term of…
In this paper, we describe finite, additively commutative, congruence simple semirings. The main result is that the only such semirings are those of order 2, zero-multiplication rings of prime order, matrix rings over finite fields, those…
In this paper we discuss several constructions that lead to new examples of nil-clean, clean, and exchange rings. A characterization of the idempotents in the algebra defined by a 2-cocycle is given and used to prove some of the algebra's…
Work in progress concerning alternative formalizations of arithmetic.
We propose the notion of semi-infinite homology for algebras over operads using the relative homology theory for operadic algebras.
In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…
The history of complementary observables and mutual unbiased bases is reviewed. A characterization is given in terms of conditional entropy of subalgebras. The concept of complementarity is extended to non-commutative subalgebras.…
We consider the preservation of properties of being finitely generated, being finitely presented and being residually finite under direct products in the context of different types of algebraic structures. The structures considered include…
We extend the theory of atomized semilattices to the infinite setting. We show that it is well-defined and that every semilattice is atomizable. We also study atom redundancy, focusing on complete and finitely generated semilattices and…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
Iteration semirings are Conway semirings satisfying Conway's group identities. We show that the semirings $\N^{\rat}\llangle \Sigma^* \rrangle$ of rational power series with coefficients in the semiring $\N$ of natural numbers are the free…
By using variational methods, the existence of infinitely many solutions for a nonlinear algebraic system with a parameter is established in presence of a perturbed Lipschitz term. Our goal was achieved requiring an appropriate behavior of…
We study transformational program logics for correctness and incorrectness that we extend to explicitly handle both termination and nontermination. We show that the logics are abstract interpretations of the right image transformer for a…
These lecture notes for the 2013 CIME/CIRM summer school Combinatorial Algebraic Geometry deal with manifestly infinite-dimensional algebraic varieties with large symmetry groups. So large, in fact, that subvarieties stable under those…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…
The halting problem is undecidable --- but can it be solved for "most" inputs? This natural question was considered in a number of papers, in different settings. We revisit their results and show that most of them can be easily proven in a…
This is a study of universal problems for semimodules, in particular coequalizers, coproducts, and tensor products. Furthermore the structure theory of semiideals of the semiring of natural numbers is extended.