Sciweavers

63 search results - page 9 / 13
» The Bounded Axiom A Forcing Axiom
Sort
View
AML
2008
66views more  AML 2008»
13 years 8 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
JSYML
2002
63views more  JSYML 2002»
13 years 8 months ago
Wellordering Proofs for Metapredicative Mahlo
In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the u...
Thomas Strahm
SCALESPACE
2007
Springer
14 years 2 months ago
Spatio-temporal Scale-Spaces
Abstract. A family of spatio-temporal scale-spaces suitable for a moving observer is developed. The scale-spaces are required to be time causal for being usable for real time measu...
Daniel Fagerström
TARK
1998
Springer
14 years 24 days ago
Hypothetical Knowledge and Counterfactual Reasoning
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
Joseph Y. Halpern
FOSSACS
2004
Springer
14 years 2 months ago
Bisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
Gerald Lüttgen, Walter Vogler