Sciweavers

351 search results - page 7 / 71
» Classical proof forestry
Sort
View
CIE
2006
Springer
13 years 11 months ago
Understanding and Using Spector's Bar Recursive Interpretation of Classical Analysis
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...
Paulo Oliva
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
ENTCS
2011
129views more  ENTCS 2011»
13 years 2 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis
LOPSTR
1995
Springer
13 years 11 months ago
Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
Christoph Kreitz, Jens Otten, Stephan Schmitt
STTT
2010
113views more  STTT 2010»
13 years 2 months ago
Proved development of the real-time properties of the IEEE 1394 Root Contention Protocol with the event-B method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm