Related papers: Algebraic Presentations of Dependent Type Theories
The paper discusses from a metaphysical standpoint the nature of the dependence relation underpinning the talk of mutual action between material and spatiotemporal structures in general relativity. It is shown that the standard analyses of…
Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…
This is a short survey on the recent developments made in the integration theory with effective formulas of algebraic structures stronger or higher than Lie algebras.
In a Systems Engineering setting, various models are produced using a variety of methods and tools. Focusing on a type of models -- called descriptive models -- which we shall describe, we argue that, while the clarity and precision of…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
We give an introduction to the topics of our forthcoming work, in which we introduce and study new mathematical objects which we call "higher theories" of algebras, where inspiration for the term comes from William Lawvere's notion of…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
We show how to build models of Synthetic Algebraic Geometry over rings k such that finitely presented k-algebra have a decidable equality. The construction is done in a constructive and weak (same proof theoretic strength as dependent type…
We introduce a universal algebraic generalization of de Jongh's notion of dependence for formulas of intuitionistic propositional logic, relating it to a notion of dependence defined by Marczewski for elements of an algebraic structure.…
Network theory provides tools which are particularly appropriate for assessing the complex interdependencies that characterise our modern connected world. This article presents an introduction to network theory, in a way that doesn't…
In this paper, we introduce the notion of relation type of analytic and formal algebras and prove that it is well-defined and invariant by describing this notion in terms of the Andr\'e-Quillen homology and using the Jacobi-Zariski long…
We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…
Type theory can be described as a generalised algebraic theory. This automatically gives a notion of model and the existence of the syntax as the initial model, which is a quotient inductive-inductive type. Algebraic definitions of type…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
Over the last 20 years a large number of automata-based specification theories have been proposed for modeling of discrete,real-time and probabilistic systems. We have observed a lot of shared algebraic structure between these formalisms.…
The rules of d-separation provide a framework for deriving conditional independence facts from model structure. However, this theory only applies to simple directed graphical models. We introduce relational d-separation, a theory for…
For a dependent theory T, in C_T for every type definable group G, the intersection of type definable subgroups with bounded index is a type definable subgroup with bounded index.
We continue the investigation of tabular algebras with trace (a certain class of associative ${\Bbb Z}[v, v^{-1}]$-algebras equipped with distinguished bases) by determining the extent to which the tabular structure may be recovered from a…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…