Related papers: A Generic Framework for Diamond Lemmas
We introduce and study a family of axioms that closely follows the pattern of parametrized diamonds, studied by Moore, Hru\v{s}\'ak, and D\v{z}amonja in [13]. However, our approach appeals to model theoretic / forcing theoretic notions,…
In this paper, we firstly establish Composition-Diamond lemma for $\Omega$-algebras. We give a Gr\"{o}bner-Shirshov basis of the free $L$-algebra as a quotient algebra of a free $\Omega$-algebra, and then the normal form of the free…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…
We answer an open question in the theory of transducer degrees on the existence of a diamond structure in the transducer hierarchy. Transducer degrees are the equivalence classes formed by word transformations which can be realized by a…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
The objective of this paper is twofold: (i) to survey existing results of generalized polynomials on time scales, covering definitions and properties for both delta and nabla derivatives; (ii) to extend previous results by using the more…
We introduce a notion of generalized homogeneous derivations on graded rings as a natural extension of the homogeneous derivations defined by Kanunnikov. We then define gr-generalized derivations, which preserve the degrees of homogeneous…
We construct free modules over an associative conformal algebra. We establish Composition-Diamond lemma for associative conformal modules. As applications, Gr\"obner-Shirshov bases of the Virasoro conformal module and module over the…
We present a general framework to represent discrete configuration systems using hypergraphs. This representation allows one to transfer combinatorial removal lemmas to their analogues for configuration systems. These removal lemmas claim…
The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…
We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…
We investigate the complexity of modal satisfiability for certain combinations of modal logics. In particular we examine four examples of multimodal logics with dependencies and demonstrate that even if we restrict our inputs to…
In this paper, we establish the Composition-Diamond lemma for associative algebras with multiple linear operators. As applications, we obtain Groebner-Shirshov bases of free Rota-Baxter algebra, $\lambda$-differential algebra and…
For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…
A structural analysis of construction schemes is developed. That analysis is used to give simple and new constructions of combinatorial objects which have been of interest to set theorists and topologists. We then continue the study of…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the…
In this paper we shall prove that any $2$-transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure. In particular, this adapts a result of Koponen for binary…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…