منابع مشابه
Minimality of Non Σ-scattered Orders
In this paper we will characterize — under appropriate axiomatic assumptions — when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming PFA, the only linear orders which are minimal with respect to not being σ-scattered are either Countryman types or real types. We also outline a plausible approach to demonstrating the relative co...
متن کاملTree-automatic scattered linear orders
We study tree-automatic linear orders on regular tree languages. We first show that there is no tree-automatic scattered linear order, and in particular no well-order, on the set of all finite labeled trees. This also follows from results of Gurevich-Shelah [8] and Carayol-Löding [4]. We then show that a regular tree language admits a tree-automatic scattered linear order if and only if all tre...
متن کاملIsomorphisms of scattered automatic linear orders
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic linear orders, we determine the exact level of undecidability in the arithmetical hierarchy.
متن کاملRadial Basis Functions: L -approximation orders with scattered centres
In this paper we generalize several results on uniform approximation orders with radial basis functions in (Buhmann, Dyn and Levin, 1993) and (Dyn and Ron, 1993) to L-approximation orders. These results apply, in particular, to approximants from spaces spanned by translates of radial basis functions by scattered centres. Examples to which our results apply include quasi-interpolation and least-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 2009
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm205-1-2