相关论文: Automated reasoning for proving non-orderability o…

It is known that a bi-orderable group has no generalized torsion element, but the converse does not hold in general. We conjecture that the converse holds for the fundamental groups of 3-manifolds, and verify the conjecture for…

In this article we explore a non-abelian torsion theory in the category of preordered groups: the objects of its torsion-free subcategory are the partially ordered groups, whereas the objects of the torsion subcategory are groups (with the…

This paper provides a preparatory introduction to torsors, written with a view toward later applications in the author's work. Rather than aiming at a comprehensive survey, the exposition focuses on those aspects of torsors that are most…

We prove the decidability of the elementary theory of a free group.

For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and…

Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of…

Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates…

The structure of finite and locally finite groups in which every element has prime power order (CP-groups) is well known. In this paper we note that the combination of our earlier results with the available information on the structure of…

We show that a group whose generalized torsion elements are torsion elements (which we call a $TR^{*}$-group) is torsion-by-$R^{*}$ group, an extension of torsion group by a group without generalized torsion elements. We also discuss a…

We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form.…

The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our…

We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…

It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

We first show that every group-theoretical category is graded by a certain double coset ring. As a consequence, we obtain a necessary and sufficient condition for a group-theoretical category to be nilpotent. We then give an explicit…

We show, that groups, defined by wide class of automata, including all polynomial ones, act on the set of infinite words not paradoxical

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…