SearcharxivSearch

arXiv · 1603.03092

First-Order Logic with Isomorphism

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}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Dimitris Tsementzis. 2016-03-09. First-Order Logic with Isomorphism. https://arxiv.org/abs/1603.03092

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO