DeepAI AI Chat
Log In Sign Up

The em-convex rewrite system

07/05/2018
by   Marius Buliga, et al.
imar.ro
0

We introduce and study em (or "emergent"), a lambda calculus style rewrite system inspired from dilations structures in metric geometry. Then we add a new axiom (convex) and explore its consequences. Although (convex) forces commutativity of the infinitesimal operations, Theorems 6.2, 8.9 and Proposition 8.7 appear as a lambda calculus style version of Gleason and Montgomery-Zippin solution to the Hilbert 5th problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/05/2023

Software and Analysis for Dynamic Voronoi Diagrams in the Hilbert Metric

The Hilbert metric is a projective metric defined on a convex body which...
11/21/2017

On the EM-Tau algorithm: a new EM-style algorithm with partial E-steps

The EM algorithm is one of many important tools in the field of statisti...
08/13/2021

An ML-style record calculus with extensible records

In this work, we develop a polymorphic record calculus with extensible r...
08/10/2020

On a recipe for quantum graphical languages

Different graphical calculi have been proposed to represent quantum comp...
05/04/2020

Factorize Factorization

We present a new technique for proving factorization theorems for compou...
04/27/2023

Universal Algebra for Generalised Metric Spaces

We study in this work a generalisation of the framework of quantitative ...
04/21/2023

From Tractatus to Later Writings and Back – New Implications from the Nachlass

As a celebration of the Tractatus 100th anniversary it might be worth re...