19 search results - page 1 / 4 » csl 2001 |
CSL
2001
Springer
13 years 9 months ago
2001
Springer
CSL
2001
Springer
13 years 9 months ago
2001
Springer
CSL
2001
Springer
13 years 9 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 9 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 9 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...