Sciweavers

1410 search results - page 46 / 282
» Proving theorems by reuse
Sort
View
AML
2005
58views more  AML 2005»
13 years 9 months ago
Successors of singular cardinals and coloring theorems I
In this paper, we investigate the extent to which techniques used in [10], [2], and [3] -- developed to prove coloring theorems at successors of singular cardinals of uncountable c...
Todd Eisworth, Saharon Shelah
JSYML
2010
62views more  JSYML 2010»
13 years 8 months ago
A monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
John Goodrick
MFCS
2007
Springer
14 years 4 months ago
Towards a Rice Theorem on Traces of Cellular Automata
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
Julien Cervelle, Pierre Guillon
DCG
2002
81views more  DCG 2002»
13 years 9 months ago
Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals
In this paper we study the topology of transversals to a family of convex sets as a subset of a Grassmanian manifold. This topology seems to be ruled by a combinatorial structure w...
Jorge L. Arocha, Javier Bracho, Luis Montejano, D....
CAS
1999
60views more  CAS 1999»
13 years 9 months ago
Coincidences Are not Accidental: a Theorem
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
Vladik Kreinovich