71 search results - page 5 / 15 » Complete Cuboidal Sets in Axiomatic Domain Theory |
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
TPLP
2008
13 years 7 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
AAAI
2012
11 years 10 months ago
2012
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...