27 search results - page 1 / 6 » The degree spectra of homogeneous models |
JSYML
2008
13 years 3 months ago
2008
Much previous study has been done on the degree spectra of prime models of a complete atomic decidable theory. Here we study the analogous questions for homogeneous models. We say...
JSYML
2010
12 years 11 months ago
2010
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
JSYML
2007
13 years 4 months ago
2007
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
RSA
2006
13 years 4 months ago
2006
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
DM
2008
13 years 4 months ago
2008
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...