Classifying Isomorphic Residue Classes
نویسندگان
چکیده
We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using di erent proving techniques, which are implemented as strategies in a multi-strategy proof planner. We show how these techniques help to successfully derive proofs in our domain and explain how the search space of the proof planner can be drastically reduced by employing computations of two computer algebra systems during the planning process. Moreover, we discuss the results of experiments we conducted which give evidence that with the help of the computer algebra systems the planner is able to solve problems for which it would fail to create a
منابع مشابه
On Multiplicative Semigroups of Residue Classes
The set of residue classes, modulo any positive integer, is commutative and associative under the operation of multiplication. The author made the conjecture: For each finite commutative semigroup, S, there exists a positive integer, n, such that S is isomorphic with a subsemigroup of the multiplicative semigroup of residue classes (mod n). (A semigroup is a set closed with respect to a single-...
متن کاملMethods of Class Field Theory to Separate Logics over Finite Residue Classes and Circuit Complexity
Separations among the first-order logic Res(0,+,×) of finite residue classes, its extensions with generalized quantifiers, and in the presence of a built-in order are shown in this article, using algebraic methods from class field theory. These methods include classification of spectra of sentences over finite residue classes as systems of congruences, and the study of their h-densities over th...
متن کاملRecursive constructions for triangulations
Three recursive constructions are presented; two deal with embeddings of complete graphs and one with embeddings of complete tripartite graphs. All three facilitate the construction of 2an 2−o(n2) non-isomorphic face 2-colourable triangulations of Kn and Kn,n,n in orientable and non-orientable surfaces for values of n lying in certain residue classes and for appropriate constants a.
متن کاملHeavy-Tailed Behavior and Randomization in Proof Planning
Proof Planning Proof planning considers mathematical theorems as planning problems. A proof planning problem is defined by an initial state specified by the proof assumptions, the goal state given by the theorem to be proved, and a set of planning operators called methods. Finding a proof corresponds therefore to searching for a sequence of planning operators that derive the theorem from the as...
متن کامل