Search arXivSearch

arXiv · 1307.0108

Intuitionistic First-Order Logic: Categorical Semantics via the Curry-Howard Isomorphism

Abstract

This reports introduces a novel sound and complete semantics for first order intuitionistic logic, in the framework of category theory and by the computational interpretation of the logic based on the so-called Curry-Howard isomorphism. Aside, a sound and complete semantics for the corresponding lambda-calculus is derived, too. This semantics extends, in a way, the more traditional meanings given by Heyting categories, the topos-theoretic interpretation, and Kripke models. The feature which justifies the introduction of this novel semantics is the fact that it is 'point-free', i.e., there is no universe whose elements are used to interpret the logical terms. In other words, terms do not denote individuals of some collection but, instead, they denote the 'glue' which keeps together the interpretations of statements, similarly to what happens in formal topology. Since the proposed semantics can be trivially extended to all the first-order logical theories based on the intuitionistic system (and, with some care, to minimal systems as well), the semantics covers also all the predicative theories, even if some peculiar aspects of these theories should be remarked.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Benini. 2013-06-29. Intuitionistic First-Order Logic: Categorical Semantics via the Curry-Howard Isomorphism. https://arxiv.org/abs/1307.0108

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