CSL
2001
Springer
13 years 12 months ago
2001
Springer
CSL
2001
Springer
13 years 12 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
act Look at Realizability Edmund Robinson and Guiseppe Rosolini Department of Computer Science Research Report No. RR-01-01 ISSN 1470-5559 March 2001
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In this paper we show how to extend a constructive type theory with a principle that captures the spirit of Markov’s principle from constructive recursive mathematics. ...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
CSL
2001
Springer
13 years 12 months ago
2001
Springer
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
CSL
2001
Springer
13 years 12 months ago
2001
Springer
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...