8699 search results - page 108 / 1740 » Elements of the Theory of Computation |
AISB
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
AAAI
2007
13 years 11 months ago
2007
This paper describes recent results from the robotics community that develop a theory, similar in spirit to the theory of computation, for analyzing sensor-based agent systems. Th...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
CIE
2010
Springer
13 years 7 months ago
2010
Springer
We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor-Bendixson rank one contain only eventually periodic elements. Any ...