اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn a paraconsistentization functor in the category of consequence structures
120
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which emph{ex falso quodlibet} holds, how to convert it into a logic not satisfying this principle? We use a framework provided by category theory in order to define a category of consequence structures. Then, we propose a functor to transform a logic not able to deal with contradictions into a paraconsistent one. Moreover, we study the case of paraconsistentization of propositional classical logic.
قيم البحث
اقرأ أيضاً
This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate especially the case of three-valued systems showing how paraconsistent three-valued logics can be obtained from them.
We show that the comma category $(mathcal{F}downarrowmathbf{Grp})$ of groups under the free group functor $mathcal{F}: mathbf{Set} to mathbf{Grp}$ contains the category $mathbf{Gph}$ of simple graphs as a full coreflective subcategory. More broadly,
we generalize the embedding of topological spaces into Steven Vickers category of topological systems to a simple technique for embedding certain categories into comma categories, then show as a straightforward application that simple graphs are coreflective in $(mathcal{F}downarrowmathbf{Grp})$.
We present a family of model structures on the category of multicomplexes. There is a cofibrantly generated model structure in which the weak equivalences are the morphisms inducing an isomorphism at a fixed stage of an associated spectral sequence.
Corresponding model structures are given for truncate
Assuming that $0^#$ exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure $mathcal A$ such that [ Sp({mathcal A}) = {{bf x}:{bf x}in Sp ({mathcal A})}, ] where $Sp ({mathcal A})$ is
the set of Turing degrees which compute a copy of $mathcal A$. It turns out that, more interesting than the result itself, is its unexpected complexity. We prove that higher-order arithmetic, which is the union of full $n$th-order arithmetic for all $n$, cannot prove the existence of such a structure.
A sequence of functions f_n: X -> R from a Baire space X to the reals is said to converge in category iff every subsequence has a subsequence which converges on all but a meager set. We show that if there exists a Souslin Tree then there exists a non
atomic Baire space X such that every sequence which converge in category converges everywhere on a comeager set. This answers a question of Wagner and Wilczynski, Convergence of sequences of measurable functions, Acta Math Acad Sci Hung 36(1980), 125-128.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
