JSYML
2007
13 years 11 months ago
2007
JSYML
2007
13 years 11 months ago
2007
Let A1, . . . , An, An+1 be a finite sequence of algebras of sets given on a set X, n k=1 Ak = P(X), with more than 4 3 n pairwise disjoint sets not
JSYML
2007
13 years 11 months ago
2007
We consider embeddings of structures which preserve spectra: if g : M → S with S computable, then M should have the same Turing degree spectrum (as a structure) that g(M) has (a...
JSYML
2007
13 years 11 months ago
2007
JSYML
2007
13 years 11 months ago
2007
We show that every nonzero Σ0 2 enumeration degree bounds a nonsplitting nonzero enumeration degree.
JSYML
2007
13 years 11 months ago
2007
Let M = M, +, <, 0, {λ}λ∈D be an ordered vector space over an ordered division ring D, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is defin...
JSYML
2007
13 years 11 months ago
2007
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
JSYML
2007
13 years 11 months ago
2007
We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determi...
JSYML
2007
13 years 11 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...
JSYML
2007
13 years 11 months ago
2007