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...
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 ...
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 )...
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...
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...