Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.00298

Connecting abstract logics and adjunctions in the theory of ($\pi$-)institutions: some theoretical remarks and applications

Gabriel Bittencourt Rios·Daniel de Almeida Souza·Darllan Conceição Pinto·Hugo Luiz Mariano
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the present work, a natural sequel to \cite{MaPi1}, we further discuss the existence of adjunctions between categories of institutions and of $\pi$-institutions. This is done at both a foundational and an applied level. Firstly, we reformulate and conceptually clarify such adjunctions in terms of the $2$-categorical data involved in the construction of categories of institution-like structures. More precisely, we remark that the process used for passing from rooms to institutions (\cite{Diac2}) can be extended, due to its $2$-functoriality, to more general room-like and institution-like structures in such a way that the aforementioned adjunctions are all seen to arise from simpler adjunctions at the room-like level. Secondly, and mostly independently, we provide some applications of such adjunctions to abstract logics, mainly to the setting of propositional logics and filter pairs (\cite{AMP1}); we also generalize the process of skolemization, a classical device from predicate logic, to the institutional setting.

Explore related subjects

math.LOmath.CT

Keep this discovery

BibTeXRIS

Gabriel Bittencourt Rios, Daniel de Almeida Souza, Darllan Conceição Pinto, Hugo Luiz Mariano. 2020-02-02. Connecting abstract logics and adjunctions in the theory of ($\pi$-)institutions: some theoretical remarks and applications. https://arxiv.org/abs/2002.00298

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗