Related papers: On Sets of Premises
We study polynomial comonads and polynomial bicomodules. Polynomial comonads amount to categories. Polynomial bicomodules between categories amount to parametric right adjoint functors between corresponding copresheaf categories. These may…
Argumentation is a non-monotonic process. This reflects the fact that argumentation involves uncertain information, and so new information can cause a change in the conclusions drawn. However, the base logic does not need to be…
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…
In this paper we recall some results for conditional events, compound conditionals, conditional random quantities, p-consistency, and p-entailment. Then, we show the equivalence between bets on conditionals and conditional bets, by…
Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…
This report consists of two parts. The first part is a brief exposition of classical descriptive set theory. This part introduces some fundamental concepts, motivations and results from the classical theory and ends with a section on the…
A model of knowledge representation is described in which propositional facts and the relationships among them can be supported by other facts. The set of knowledge which can be supported is called the set of cognitive units, each having…
We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…
For an adjoint pair $(F, G)$ of functors, we prove that $G$ is a separable functor if and only if the defined monad is separable and the associated comparison functor is an equivalence up to retracts. In this case, under an idempotent…
Bidirectional data accessors such as lenses, prisms and traversals are all instances of the same general 'optic' construction. We give a careful account of this construction and show that it extends to a functor from the category of…
We consider (finitary, propositional) logics through the original use of Category Theory: the study of the "sociology of mathematical objects", aligning us with a recent, and growing, trend of study logics through its relations with other…
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learning and factor analysis. In this work, we propose a…
We develop a model of abduction in abstract argumentation, where changes to an argumentation framework act as hypotheses to explain the support of an observation. We present dialogical proof theories for the main decision problems (i.e.,…
Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…
Detection and elimination of redundant clauses from propositional formulas in Conjunctive Normal Form (CNF) is a fundamental problem with numerous application domains, including AI, and has been the subject of extensive research. Moreover,…
Diers developed a general theory of right multi-adjoint functors leading to a purely categorical, point-set construction of spectra. Situations of multiversal properties return sets of canonical solutions rather than a unique one. In the…
A category used by de Paiva to model linear logic also occurs in Vojtas's analysis of cardinal characteristics of the continuum. Its morphisms have been used in describing reductions between search problems in complexity theory. We describe…
Knowledge representation is a popular research field in IT. As mathematical knowledge is most formalized, its representation is important and interesting. Mathematical knowledge consists of various mathematical theories. In this paper we…
We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…
We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…