اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدK-trivials are NCR
36
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that for every K-trivial real X, there is no representation of a continuous probability measure m such that X is 1-random relative to m.
قيم البحث
اقرأ أيضاً
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a computabl
e A such that A is x-computably categorical, and for all y, if A is y-computably categorical then y computes x. We construct a Sigma_2 set whose degree is not a degree of categoricity. We also demonstrate a large class of degrees that are not degrees of categoricity by showing that every degree of a set which is 2-generic relative to some perfect tree is not a degree of categoricity. Finally, we prove that every noncomputable hyperimmune-free degree is not a degree of categoricity.
All known structural extensions of the substructural logic $mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by ${vee, cdot, 1}$-equations) have decidable t
heoremhood; in particular all the ones defined by knotted axioms enjoy strong decidability properties (such as the finite embeddability property). We provide infinitely many such extensions that have undecidable theoremhood, by encoding machines with undecidable halting problem. An even bigger class of extensions is shown to have undecidable deducibility problem (the corresponding varieties of residuated lattices have undecidable word problem); actually with very few exceptions, such as the knotted axioms and the other prespinal axioms, we prove that undecidability is ubiquitous. Known undecidability results for non-commutative extensions use an encoding that fails in the presence of commutativity, so and-branching counter machines are employed. Even these machines provide encodings that fail to capture proper extensions of commutativity, therefore we introduce a new variant that works on an exponential scale. The correctness of the encoding is established by employing the theory of residuated frames.
In cite{CGH15} we introduced TiRS graphs and TiRS frames to create a new natural setting for duals of canonical extensions of lattices. In this continuation of cite{CGH15} we answer Problem 2 from there by characterising the perfect lattices that are
dual to TiRS frames (and hence TiRS graphs). We introduce a new subclass of perfect lattices called PTi lattices and show that the canonical extensions of lattices are PTi lattices, and so are `more than just perfect lattices. We introduce morphisms of TiRS structures and put our correspondence between TiRS graphs and TiRS frames from cite{CGH15} into a full categorical framework. We illustrate our correspondences between classes of perfects lattices and classes of TiRS graphs by examples.
By exploiting the geometry of involutions in $N_circ^circ$-groups of finite Morley rank, we show that any simple group of Morley rank $5$ is a bad group all of whose proper definable connected subgroups are nilpotent of rank at most $2$. The main res
ult is then used to catalog the nonsoluble connected groups of Morley rank $5$.
Let $2<n<mleq omega$. Let $CA_n$ denote the class of cylindric algebras of dimension $n$ and $RCA_n$ denote the class of representable $CA_n$s. We say that $Ain RCA_n$ is representable up to $m$ if $CmAtA$ has an $m$-square representation. An $m$ squ
are represenation is locally relativized represenation that is classical locally only on so called $m$-squares. Roughly if we zoom in by a movable window to an $m$ square representation, there will become a point determinded and depending on $m$ where we mistake the $m$ square-representation for a genuine classical one. When we zoom out the non-representable part gets more exposed. For $2<n<m<lleq omega$, an $l$ square represenation is $m$-square; the converse however is not true. The variety $RCA_n$ is a limiting case coinciding with $CA_n$s having $omega$-square representations. Let $RCA_n^m$ be the class of algebras representable up to $m$. We show that $RCA_n^{m+1}subsetneq bold RCA_n^m$ for $mgeq n+2$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
