اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn functors enumerating structures
133
0
0.0
(
0
)
تأليف
Dino Rossegger
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the equivalence relation computable are equivalent. We also obtain results on the relation between enumerable and computable functors.
قيم البحث
اقرأ أيضاً
We study reductions well suited to compare structures and classes of structures with respect to properties based on enumeration reducibility. We introduce the notion of a positive enumerable functor and study the relationship with established reductions based on functors and alternative definitions.
In several classes of countable structures it is known that every hyperarithmetic structure has a computable presentation up to bi-embeddability. In this article we investigate the complexity of embeddings between bi-embeddable structures in two such
classes, the classes of linear orders and Boolean algebras. We show that if $mathcal L$ is a computable linear order of Hausdorff rank $n$, then for every bi-embeddable copy of it there is an embedding computable in $2n-1$ jumps from the atomic diagrams. We furthermore show that this is the best one can do: Let $mathcal L$ be a computable linear order of Hausdorff rank $ngeq 1$, then $mathbf 0^{(2n-2)}$ does not compute embeddings between it and all its computable bi-embeddable copies. We obtain that for Boolean algebras which are not superatomic, there is no hyperarithmetic degree computing embeddings between all its computable bi-embeddable copies. On the other hand, if a computable Boolean algebra is superatomic, then there is a least computable ordinal $alpha$ such that $mathbf 0^{(alpha)}$ computes embeddings between all its computable bi-embeddable copies. The main technique used in this proof is a new variation of Ash and Knights pairs of structures theorem.
Let 0<n^*< omega and f:X-> n^*+1 be a function where X subseteq omega backslash (n^*+1) is infinite. Consider the following set S_f= {x subset aleph_omega : |x| <= aleph_{n^*} & (for all n in X)cf(x cap alpha_n)= aleph_{f(n)}}. The question, first po
sed by Baumgartner, is whether S_f is stationary in [alpha_omega]^{< aleph_{n^*+1}}. By a standard result, the above question can also be rephrased as certain transfer property. Namely, S_f is stationary iff for any structure A=< aleph_omega, ... > theres a B prec A such that |B|= aleph_{n^*} and for all n in X we have cf(B cap aleph_n)= aleph_{f(n)}. In this paper, we are going to prove a few results concerning the above question.
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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
