Functorial Semantics for Partial Theories

11/12/2020
by   Ivan Di Liberti, et al.
0

We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of string diagrams as terms. This allows for equational reasoning about the class of models defined by a partial theory. We demonstrate the expressivity of such equational theories by considering a number of examples, including partial combinatory algebras and cartesian closed categories. Moreover, despite the increase in expressivity of the syntax we retain a well-behaved notion of semantics: we show that our categories of models are precisely locally finitely presentable categories, and that free models exist.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/19/2020

Syntactic categories for dependent type theory: sketching and adequacy

We argue that locally Cartesian closed categories form a suitable doctri...
06/08/2021

Globular weak ω-categories as models of a type theory

We study the dependent type theory CaTT, introduced by Finster and Mimra...
06/18/2020

Compositional theories for embedded languages

Embedded programming style allows to split the syntax in two parts, repr...
06/08/2019

Paraconsistency, resolution and relevance

Digraphs provide an alternative syntax for propositional logic, with dig...
02/27/2021

Generalized Universe Hierarchies and First-Class Universe Levels

In type theories, universe hierarchies are commonly used to increase the...
04/04/2018

Categories of empirical models

A notion of morphism that is suitable for the sheaf-theoretic approach t...
10/21/2021

Fuzzy Algebraic Theories

In this work we propose a formal system for fuzzy algebraic reasoning. T...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.