2233 search results - page 63 / 447 » On the Complexity of Theory Curbing |
162
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
152
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
206
click to vote
JELIA
1994
Springer
15 years 10 months ago
1994
Springer
: In this paper we describe a general way of formalizing reasoning behaviour. Such a behaviour may be described by all the patterns which are valid for the behaviour. A pattern can...
172
click to vote
MST
2007
15 years 5 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
182
click to vote
CNSR
2007
IEEE
16 years 15 days ago
2007
IEEE
The theory of natural movement is fundamental to space syntax: a set of theories and methods developed in the late 1970s that seeks, at a general level, to reveal the mutual effec...