Switch to: References

Citations of:

A method for avoiding the Curry paradox

In Nicholas Rescher (ed.), Essays in Honor of Carl G. Hempel. Reidel. pp. 255--265 (1969)

Add citations

You must login to add citations.
  1. Stability and Paradox in Algorithmic Logic.Wayne Aitken & Jeffrey A. Barrett - 2007 - Journal of Philosophical Logic 36 (1):61-95.
    There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Computer Implication and the Curry Paradox.Wayne Aitken & Jeffrey A. Barrett - 2004 - Journal of Philosophical Logic 33 (6):631-637.
    There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   7 citations