Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

First-Order Logic with Isomorphism (1603.03092v2)

Published 9 Mar 2016 in math.LO and math.CT

Abstract: The Univalent Foundations requires a logic that allows us to define structures on homotopy types, similar to how first-order logic with equality ($\text{FOL}=$) allows us to define structures on sets. We develop the syntax, semantics and deductive system for such a logic, which we call first-order logic with isomorphism ($\text{FOL}{\cong}$). The syntax of $\text{FOL}{\cong}$ extends $\text{FOL}{=}$ in two ways. First, by incorporating into its signatures a notion of dependent sorts along the lines of Makkai's FOLDS as well as a notion of an $h$-level of each sort. Second, by specifying three new logical sorts within these signatures: isomorphism sorts, reflexivity predicates and transport structure. The semantics for $\text{FOL}{\cong}$ are then defined in homotopy type theory with the isomorphism sorts interpreted as identity types, reflexivity predicates as relations picking out the trivial path, and transport structure as transport along a path. We then define a deductive system $\mathcal{D}{\cong}$ for $\text{FOL}{\cong}$ that encodes the sense in which the inhabitants of isomorphism sorts really do behave like isomorphisms and prove soundness of the rules of $\mathcal{D}{\cong}$ with respect to its homotopy semantics. Finally, as an application, we prove that precategories, strict categories and univalent categories are axiomatizable in $\text{FOL}_{\cong}$.

Summary

We haven't generated a summary for this paper yet.