Sciweavers

1302 search results - page 65 / 261
» Free-Style Theorem Proving
Sort
View
CORR
2006
Springer
66views Education» more  CORR 2006»
13 years 7 months ago
Coding into a source: a direct inverse Rate-Distortion theorem
Shannon proved that if we can transmit bits reliably at rates larger than the rate distortion function R(D), then we can transmit this source to within a distortion D. We answer th...
Mukul Agarwal, Anant Sahai, Sanjoy K. Mitter
JSYML
2007
79views more  JSYML 2007»
13 years 7 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 7 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore