1101 search results - page 114 / 221 » Forcing in proof theory |
153
Voted
AI
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
170
click to vote
FOAL
2009
ACM
16 years 6 days ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
131
click to vote
CIE
2005
Springer
15 years 11 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
142
click to vote
TPHOL
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...