Sciweavers

1101 search results - page 218 / 221
» Forcing in proof theory
Sort
View
JACM
2002
163views more  JACM 2002»
13 years 7 months ago
Formal verification of standards for distance vector routing protocols
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gu...
MSCS
2007
125views more  MSCS 2007»
13 years 7 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
ECCC
2010
122views more  ECCC 2010»
13 years 6 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
JELIA
2010
Springer
13 years 5 months ago
Stable Belief Sets Revisited
Stable belief sets were introduced by R. Stalnaker in the early ’80s, as a formal representation of the epistemic state for an ideal introspective agent. This notion motivated M...
Costas D. Koutras, Yorgos Zikos
MA
2010
Springer
135views Communications» more  MA 2010»
13 years 5 months ago
Nonparametric comparison of regression functions
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...
Ramidha Srihera, Winfried Stute