Sciweavers

1716 search results - page 109 / 344
» Proving Conditional Termination
Sort
View
BIRTHDAY
2010
Springer
15 years 1 months ago
Metrization Theorem for Space-Times: From Urysohn's Problem towards Physically Useful Constructive Mathematics
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
Vladik Kreinovich
JAT
2006
66views more  JAT 2006»
15 years 23 days ago
An extrapolation theorem for nonlinear approximation and its applications
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
Feng Dai
76
Voted
JSYML
2007
62views more  JSYML 2007»
15 years 20 days ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras
113
Voted
AI
1998
Springer
15 years 15 days ago
Pruning Algorithms for Multi-Model Adversary Search
The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prov...
David Carmel, Shaul Markovitch
97
Voted
CORR
2011
Springer
137views Education» more  CORR 2011»
14 years 7 months ago
An improvement of the Moser-Tardos algorithmic local lemma
A recent theorem of Bissacot, et al. proved using results about the cluster expansion in statistical mechanics extends the Lov´asz Local Lemma by weakening the conditions under w...
Wesley Pegden