Graduate studies at Western
Journal of Philosophical Logic 36 (1):61 - 95 (2007)
|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 , 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)|
|Through your library||Configure|
Similar books and articles
Martin Bunder & Wil Dekkers (2001). Pure Type Systems with More Liberal Rules. Journal of Symbolic Logic 66 (4):1561-1580.
Wayne Aitken & Jeffrey A. Barrett (2008). Abstraction in Algorithmic Logic. Journal of Philosophical Logic 37 (1):23 - 43.
Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.
Christopher Menzel (1986). A Complete, Type-Free "Second-Order" Logic and Its Philosophical Foundations. CSLI Publications.
Helena Rasiowa (1981). On Logic of Complex Algorithms. Studia Logica 40 (3):289 - 310.
Marcin Miłkowski (2009). Is Evolution Algorithmic? Minds and Machines 19 (4):465-475.
Bart Jacobs (1989). The Inconsistency of Higher Order Extensions of Martin-Löf's Type Theory. Journal of Philosophical Logic 18 (4):399 - 422.
Vladimir V. Rybakov (2011). Best Unifiers in Transitive Modal Logics. Studia Logica 99 (1-3):321-336.
Karel Lambert (ed.) (1991). Philosophical Applications of Free Logic. Oxford University Press.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #292,563 of 739,354 )
Recent downloads (6 months)0
How can I increase my downloads?