3552 search results - page 518 / 711 » Proof theory in the abstract |
184
click to vote
JSYML
2007
15 years 6 months ago
2007
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 ...
206
click to vote
JACM
2002
15 years 6 months ago
2002
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: ...
187
click to vote
MSCS
2007
15 years 6 months ago
2007
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...
159
click to vote
ECCC
2010
15 years 5 months ago
2010
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...
188
click to vote
JELIA
2010
Springer
15 years 5 months ago
2010
Springer
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...