Sciweavers

103 search results - page 11 / 21
» jsyml 2006
Sort
View
JSYML
2000
54views more  JSYML 2000»
13 years 9 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
JSYML
2000
56views more  JSYML 2000»
13 years 9 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»
13 years 9 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
2002
70views more  JSYML 2002»
13 years 9 months ago
Coding with Ladders A Well Ordering of The Reals
Any model of ZFC + GCH has a generic extension (made with a poset of size 2) in which the following hold: MA + 20 = 2+ there exists a 2 1-well ordering of the reals. The proof con...
Uri Abraham, Saharon Shelah
JSYML
2002
66views more  JSYML 2002»
13 years 9 months ago
Proving Consistency of Equational Theories in Bounded Arithmetic
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
Arnold Beckmann