1670 search results - page 136 / 334 » On Skolemization in constructive theories |
160
click to vote
ADC
2003
Springer
15 years 11 months ago
2003
Springer
Mathematics is forcing towards a consistent framework of theory development. Computer Science is an engineering discipline and sometimes suffers from ad-hoc definitions. Transac...
156
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
155
click to vote
CCA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. General methods of investigating effectivity on regular Hausdorff (T3) spaces is considered. It is shown that there exists a functor from a category of T3 spaces into a c...
155
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
Higman's lemma has a very elegant, non-constructive proof due to Nash-Williams [NW63] using the so-called minimal-bad-sequence argument. The objective of the present paper is ...
159
click to vote
FLAIRS
2008
15 years 8 months ago
2008
In Artificial Intelligence, a crucial requirement is the ability to reason about actions and their effects on the environment. Traditional approaches which rely on classical logic...