• Corpus ID: 235166298

# Homotopies in Multiway (Non-Deterministic) Rewriting Systems as n-Fold Categories

@article{Arsiwalla2021HomotopiesIM,
title={Homotopies in Multiway (Non-Deterministic) Rewriting Systems as n-Fold Categories},
author={Xerxes D. Arsiwalla and Jonathan Gorard and Hatem Elshatlawy},
journal={ArXiv},
year={2021},
volume={abs/2105.10822}
}
• Published 22 May 2021
• Mathematics
• ArXiv
We investigate algebraic and compositional properties of abstract multiway rewriting systems, which are archetypical structures underlying the formalism of the Wolfram model. We demonstrate the existence of higher homotopies in this class of rewriting systems, where homotopical maps are induced by the inclusion of appropriate rewriting rules taken from an abstract rulial space of all possible such rules. Furthermore, we show that a multiway rewriting system with homotopies up to order n may…
1 Citations

## Figures from this paper

An Invitation to Higher Arity Science
• Mathematics
• 2022
Analytical thinking is dominated by binary ideas. From pair-wise interactions, to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the

## References

SHOWING 1-10 OF 48 REFERENCES
Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types
• Mathematics
ArXiv
• 2021
This work formally relate abstract non-deterministic rewriting systems of the Wolfram model to higher homotopy spaces, and outlines how spatial structures can be functorially inherited starting from pregeometric type-theoretic constructions.
A type theory for synthetic ∞-categories
• Mathematics
• 2018
We propose foundations for a synthetic theory of $(\infty,1)$-categories within homotopy type theory. We axiomatize a directed interval type, then define higher simplices from it and use them to
The Univalence Principle
• Mathematics, Philosophy
ArXiv
• 2021
A general definition of indiscernibility for objects of any structure, and a corresponding univalence condition that generalizes Rezk's completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences, mean that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky.
ZX-Calculus and Extended Hypergraph Rewriting Systems I: A Multiway Approach to Categorical Quantum Information Theory
• Computer Science
ArXiv
• 2020
The objective of the present article is to begin elucidating the formal correspondence between the two methodologies in the context of the ZX-calculus formalism of Coecke and Duncan for reasoning diagrammatically about linear maps between qubits.
Open-graphs and monoidal theories†
• Computer Science, Mathematics
Mathematical Structures in Computer Science
• 2013
This paper introduces the notion of a selective adhesive functor, and shows that such a functor embeds the category of open-graphs into the ambient adhesive category of typed graphs, and inherits ‘enough adhesivity’ from the categoryof typed graphs to perform double-pushout (DPO) graph rewriting.
String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure
• Computer Science
ArXiv
• 2021
This work shows how an analogous correspondence may be established for arbitrary SMTs, once an appropriate notion of DPO rewriting (which the authors call convex) is identified, and uses the approach to show termination of two SMTs of interest: Frobenius semi-algebras and bialgebra.
Pictures of processes : automated graph rewriting for monoidal categories and applications to quantum computing
The introduction of a discretised version of a string diagram called a string graph is introduced, and it is shown how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature.
Compositionality of Rewriting Rules with Conditions
• Computer Science
Compositionality
• 2021
An intricate interplay is uncovered between the category-theoretical concepts of conditions on rules and morphisms, the compositionality and compatibility of certain shift and transport constructions for conditions, and the property of associativity of the composition of rules.
Double-pushout graph transformation revisited
• Computer Science
Mathematical Structures in Computer Science
• 2001
It is shown that injective matching provides additional expressiveness in two respects: for generating graph languages by grammars without non-terminals and for computing graph functions by convergent graph transformation systems.
Rewrite Systems
• Computer Science
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
• 1990