Sciweavers

15 search results - page 1 / 3
» Arithmetical Sacks Forcing
Sort
View
AML
2006
85views more  AML 2006»
13 years 5 months ago
Arithmetical Sacks Forcing
Abstract. We answer a question of Jockusch by constructing a hyperimmunefree minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical ...
Rod Downey, Liang Yu
APAL
2005
82views more  APAL 2005»
13 years 5 months ago
Forcing indestructibility of MAD families
Let A [] be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indest...
Jörg Brendle, Shunsuke Yatabe
CIE
2006
Springer
13 years 9 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
ERSA
2004
130views Hardware» more  ERSA 2004»
13 years 6 months ago
Computing Lennard-Jones Potentials and Forces with Reconfigurable Hardware
Abstract-- Technological advances have made FPGAs an attractive platform for the acceleration of complex scientific applications. These applications demand high performance and hig...
Ronald Scrofano, Viktor K. Prasanna
JSYML
2007
74views more  JSYML 2007»
13 years 5 months ago
A power function with a fixed finite gap everywhere
We give an application of the extender based Radin forcing to cardinal arithmetic. Assuming κ is a large enough cardinal we construct a model satisfying 2κ = κ+n together with 2...
Carmi Merimovich