Related papers: Algebraic Notions of Termination
In this paper, we investigate the algebraic properties of the expectation semirings which are semiring version of the concept of trivial extension in ring theory. We discuss ideals, primes, maximals and primary ideals of these semirings. We…
Non notherian Formal schemes of perfectoid type (for example $\mathbb{Z}_p[p^{1/p^\infty}]\langle X^{1/p^\infty} \rangle$ along with its multivariate version) with rational degree are constructed and are shown to be admissible. These formal…
In recent years, researchers have discovered various large algebraic structures that have surprising finiteness properties, such as FI-modules and Delta-modules. In this paper, we add another example to the growing list: we show that…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…
Let A be a noetherian commutative ring, and let I be an ideal in A. We study questions of flatness and I-adic completeness for infinitely generated A-modules. This is done using the notions of decaying function and I-adically free A-module.
We describe algebraic certificates of positivity for functions belonging to a finitely generated algebra of Borel measurable functions, with particular emphasis to algebras generated by semi-algebraic functions. In which case the standard…
In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…
Given a fibration over the circle, we relate the eigenspace decomposition of the algebraic monodromy, the homological finiteness properties of the fiber, and the formality properties of the total space. In the process, we prove a more…
We discuss the finiteness of (two-term) silting objects. First, we investigate new triangulated categories without silting object. Second, one studies two classes of $\tau$-tilting-finite algebras and give the numbers of their two-term…
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
Many problems in optimization theory are strongly nonlinear in the traditional sense but possess a hidden linear structure over suitable idempotent semirings. After an overview of `Idempotent Mathematics' with an emphasis on matrix theory,…
This book can be seen either as a text on theorem proving that uses techniques from general algebra, or else as a text on general algebra illustrated and made concrete by practical exercises in theorem proving. The book considers several…
We study structural limitations of purely algebraic reasoning in the analysis of arithmetic dynamical systems. Rather than addressing the truth of specific conjectures, we introduce a fragment - relative notion of algebraic refutability for…
We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…
In this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning.
We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that…
This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambda calculus with general recursion and equality types. The…
The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis…
The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic…