Stability and paradox in algorithmic logic

Journal of Philosophical Logic 36 (1):61 - 95 (2006)
Abstract
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. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally
Keywords abstraction  algorithmic logic  curry paradox  type-free logic
Categories (categorize this paper)
Reprint years 2007
DOI 10.1007/s10992-005-9024-5
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,173
Through your library
References found in this work BETA
Toward Useful Type-Free Theories. I.Solomon Feferman - 1984 - Journal of Symbolic Logic 49 (1):75-111.
Property Theory and the Revision Theory of Definitions.Francesco Orilia - 2000 - Journal of Symbolic Logic 65 (1):212-246.
Computer Implication and the Curry Paradox.Wayne Aitken & Jeffrey A. Barrett - 2004 - Journal of Philosophical Logic 33 (6):631-637.

View all 9 references / Add more references

Citations of this work BETA
Abstraction in Fitch's Basic Logic.Eric Thomas Updike - 2012 - History and Philosophy of Logic 33 (3):215-243.
Abstraction in Algorithmic Logic.Wayne Aitken & Jeffrey A. Barrett - 2008 - Journal of Philosophical Logic 37 (1):23-43.

Add more citations

Similar books and articles
Pure Type Systems with More Liberal Rules.Martin Bunder & Wil Dekkers - 2001 - Journal of Symbolic Logic 66 (4):1561-1580.
Philosophical Applications of Free Logic.Karel Lambert (ed.) - 1991 - Oxford University Press.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
The Inconsistency of Higher Order Extensions of Martin-Löf's Type Theory.Bart Jacobs - 1989 - Journal of Philosophical Logic 18 (4):399 - 422.
Is Evolution Algorithmic?Marcin Miłkowski - 2009 - Minds and Machines 19 (4):465-475.
On Logic of Complex Algorithms.Helena Rasiowa - 1981 - Studia Logica 40 (3):289 - 310.
Algorithmic Logic. Multiple-Valued Extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.

Monthly downloads

Added to index

2009-01-28

Total downloads

65 ( #78,374 of 2,152,487 )

Recent downloads (6 months)

2 ( #281,161 of 2,152,487 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums