Journal of Philosophical Logic 37 (1) (2008)
|Abstract||We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation trees. Then we show that the abstraction principle leads to a Curry fixed point, a statement C that asserts C ⇒ A where A is any given statement. When A is false, such a C yields a paradoxical situation. As discussed in our earlier work, this situation leaves one no choice but to restrict the use of a certain class of implicational rules including modus ponens|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Rafal Urbaniak (2010). Neologicist Nominalism. Studia Logica 96 (2):149-173.
Sabine Broda & Luís Damas (1997). Compact Bracket Abstraction in Combinatory Logic. Journal of Symbolic Logic 62 (3):729-740.
Giuseppe Primiero (2009). Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information. History and Philosophy of Logic 30 (3):257-282.
Helena Rasiowa (1979). Algorithmic Logic. Multiple-Valued Extensions. Studia Logica 38 (4):317 - 335.
Neil Tennant (2004). A General Theory of Abstraction Operators. Philosophical Quarterly 54 (214):105-133.
Eric Thomas Updike (2012). Abstraction in Fitch's Basic Logic. History and Philosophy of Logic 33 (3):215-243.
M. W. Bunder (2000). Expedited Broda-Damas Bracket Abstraction. Journal of Symbolic Logic 65 (4):1850-1857.
Jeffrey Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Melvin Fitting (2006). FOIL Axiomatized. Studia Logica 84 (1):1 - 22.
Added to index2009-01-28
Total downloads6 ( #145,729 of 549,520 )
Recent downloads (6 months)1 ( #63,397 of 549,520 )
How can I increase my downloads?