Corpus ID: 224803975

Isotropy and Combination Problems

@article{Parker2020IsotropyAC,
  title={Isotropy and Combination Problems},
  author={Jason Parker},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.09821}
}
  • Jason Parker
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion of inner automorphism for the theory. Using results from the treatment of combination problems in term rewriting theory, we show in this article that if $\mathbb{T}_1$ and $\mathbb{T}_2$ are (disjoint) equational theories satisfying minimal assumptions, then… Expand

References

SHOWING 1-8 OF 8 REFERENCES
Isotropy of Algebraic Theories
TLDR
The main technical result is a syntactic characterization of the isotropy group of an algebraic theory, and the usefulness of this characterization is illustrated by applying it to various concrete examples of algebraic theories. Expand
An inner automorphism is only an inner automorphism, but an inner endomorphism can be something strange
The inner automorphisms of a group G can be characterized within the category of groups without reference to group elements: they are precisely those au- tomorphisms of G that can be extended, in aExpand
ISOTROPY AND CROSSED TOPOSES
In memory of Hugh Millington Abstract. Motivated by constructions in the theory of inverse semigroups and etale groupoids, we dene and investigate the concept of isotropy from a topos-theoretic per-Expand
Partial Horn logic and cartesian categories
TLDR
The simplicity of the quasi-equational form allows an easy predicative constructive proof of the free partial model theorem for cartesian theories: that if a theory morphism is given from one cartesian theory to another, then the forgetful (reduct) functor from one model category to the other has a left adjoint. Expand
Combining Matching Algorithms: The Regular Case
  • T. Nipkow
  • Computer Science, Mathematics
  • J. Symb. Comput.
  • 1991
TLDR
It is shown that the combined matching problem is in general undecidable but that it becomes decidable if all theories are regular and an efficient combination algorithm is developed. Expand
Term rewriting and all that
TLDR
Term Rewriting and All That is a self-contained introduction to the field of term rewriting and covers all the basic material including abstract reduction systems, termination, confluence, completion, and combination problems. Expand
Isotropy Groups of Quasi-Equational Theories
t(x m )) does not collapse to any of its alien subterms, as just shown
  • the last equality holds because f (t(x 1 )