Sciweavers

1410 search results - page 135 / 282
» Proving theorems by reuse
Sort
View
ENTCS
2007
107views more  ENTCS 2007»
15 years 6 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
MLQ
2006
84views more  MLQ 2006»
15 years 6 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen
MOR
2006
94views more  MOR 2006»
15 years 6 months ago
Conditional Risk Mappings
We introduce an axiomatic definition of a conditional convex risk mapping and we derive its properties. In particular, we prove a representation theorem for conditional risk mappi...
Andrzej Ruszczynski, Alexander Shapiro
SCL
2008
79views more  SCL 2008»
15 years 5 months ago
Stability of block-triangular stationary random matrices
The objective of this note is to prove, under certain technical conditions, that the top-Lyapunov exponent of a strictly stationary random sequence of block-triangular matrices is...
László Gerencsér, György...
IGPL
2007
107views more  IGPL 2007»
15 years 5 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay