SearcharxivSearch

arXiv · 1811.01754

Back and forth between algebraic geometry, algebraic logic, sheaves and forcing

Abstract

We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our representation is defined via a contravariant functor from an algebraic category to a category of sheaves. We show that if our category is a small site (cartesian closed with a stability condition on pullbacks), then we can define a notion of forcing using this category. In particular, we define fuzzy forcing by interpreting the additional Lukasiewicz conjunction $\otimes$ as induced by a tensor product in the target monodial category of pre-sheaves. We also study topoi as semantics for higher order logic of many sorted theories in connection to set theory, and the quasi-topoi based on $MV$ algebras, for fuzzy logic. We show that the interpretation of a theory $T$, in this case into $Set_{\Omega}$ where $\Omega$ is an almost sub-object classifier in a quasi-topos $CAT$ defined from $T$, is completed by defining semantics for $\otimes$, and this is done similarly to its defining clause in forcing. We give applications to many-valued logics and various modifications of first order logic and multi-modal logic, set in an algebraic framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Trek Sayed Ahmed. 2018-11-02. Back and forth between algebraic geometry, algebraic logic, sheaves and forcing. https://arxiv.org/abs/1811.01754

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