Sciweavers

25 search results - page 3 / 5
» jsyml 2000
Sort
View
JSYML
2000
56views more  JSYML 2000»
14 years 11 months ago
Recursive in A Generic Real
There is a comeager set C contained in the set of 1-generic reals and a first order structure M such that for any real number X, there is an element of C which is recursive in X if...
Juichi Shinoda, Theodore A. Slaman
JSYML
2000
66views more  JSYML 2000»
14 years 11 months ago
A Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-sem...
Ross Willard
JSYML
2000
85views more  JSYML 2000»
14 years 11 months ago
The Logic of Choice
The choice construct (choose x : '(x)) is useful in software speci cations. We study extensions of rst-order logic with the choice construct. We prove some results about Hilb...
Andreas Blass, Yuri Gurevich
JSYML
2000
56views more  JSYML 2000»
14 years 11 months ago
Computability over The Partial Continuous Functionals
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable ov...
Dag Normann
JSYML
2000
54views more  JSYML 2000»
14 years 11 months ago
Stationary Sets and Infinitary Logic
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
Saharon Shelah, Jouko A. Väänänen