Sciweavers

301 search results - page 28 / 61
» On extensions of a theorem of Baxter
Sort
View
CCA
2009
Springer
14 years 3 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
AML
2011
204views Mathematics» more  AML 2011»
13 years 3 months ago
A note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...
Jan Krajícek
TYPES
2007
Springer
14 years 2 months ago
Attributive Types for Proof Erasure
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
Hongwei Xi
MPC
2010
Springer
157views Mathematics» more  MPC 2010»
14 years 1 months ago
Formal Derivation of Concurrent Garbage Collectors
Concurrent garbage collectors are notoriously difficult to implement correctly. Previous approaches to the issue of producing correct collectors have mainly been based on posit-and...
Dusko Pavlovic, Peter Pepper, Douglas R. Smith
CADE
2000
Springer
14 years 26 days ago
An Infrastructure for Intertheory Reasoning
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
William M. Farmer