3690 search results - page 56 / 738 » Computation with classical sequents |
ICARIS
2003
Springer
15 years 3 months ago
2003
Springer
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the ident...
STACS
2012
Springer
13 years 5 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
CSL
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
BMCBI
2007
14 years 9 months ago
2007
Background: Efforts to predict functional sites from globular proteins is increasingly common; however, the most successful of these methods generally require structural insight. ...