49 search results - page 2 / 10 » Logical Refinements of Church's Problem |
BIRTHDAY
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
BSL
2010
13 years 2 months ago
2010
This paper discusses certain problems arising within the treatment of the senses of functions in Alonzo Church's Logic of Sense and Denotation. Church understands such senses ...
BIRTHDAY
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
One of the keys to the success of the Thousands of Problems for Theorem Provers (TPTP) problem library and related infrastructure is the consistent use of the TPTP language. This p...
TCS
2008
13 years 5 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...