The Paideia Archive: Twentieth World Congress of Philosophy 8:11-18 (1998)
Authors |
|
Abstract |
This paper offers an analysis of the effect of the identity combinators in dual systems. The result is based on an easy technical trick, namely, that the identity combinators collapse all the combinators which are dual with respect to them. After reviewing dual combinators I consider the possible combinatory systems and l-calculi in which the functions and/or the application operation are bidirectional. The last section of the paper shows the devastating effect the identity combinators have for a dual system: they half trivialize simple combinatory bases, although they are not sufficient to cause real triviality for what cancellative combinators are needed.
|
Keywords | Conference Proceedings Contemporary Philosophy |
Categories |
No categories specified (categorize this paper) |
ISBN(s) | 9781634350518 |
DOI | 10.5840/wcp20-paideia19988175 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
The Church-Rosser Property in Dual Combinatory Logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.
Investigation Into Combinatory Systems with Dual Combinators.Katalin Bimbó - 2000 - Studia Logica 66 (2):285-296.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536-556.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
Some Results on Combinators in the System TRC.Thomas Jech - 1999 - Journal of Symbolic Logic 64 (4):1811-1819.
Combinators and Structurally Free Logic.J. Dunn & R. Meyer - 1997 - Logic Journal of the IGPL 5 (4):505-537.
Some Results on Combinators in the System TRC.Thomas Jech - 1999 - Journal of Symbolic Logic 64 (4):1811-1819.
Dual Combinators Bite the Dust.R. K. Meyer, K. Bimbó & J. M. Dunn - 1998 - Bulletin of Symbolic Logic 4:463-464.
Admissibility of Cut in LC with Fixed Point Combinator.Katalin Bimbó - 2005 - Studia Logica 81 (3):399-423.
Systems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
Expedited Broda-Damas Bracket Abstraction.M. W. Bunder - 2000 - Journal of Symbolic Logic 65 (4):1850-1857.
Quantification Without Variables in Connectionism.John A. Barnden & Kankanahalli Srinivas - 1996 - Minds and Machines 6 (2):173-201.
Intersection Types for Lambda-Terms and Combinators and Their Logics.Martin Bunder - 2002 - Logic Journal of the IGPL 10 (4):357-378.
Completeness of Two Systems of Illative Combinatory Logic for First-Order Propositional and Predicate Calculus.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Archive for Mathematical Logic 37 (5-6):327-341.
Analytics
Added to PP index
2020-05-08
Total views
1 ( #1,450,001 of 2,401,723 )
Recent downloads (6 months)
1 ( #551,964 of 2,401,723 )
2020-05-08
Total views
1 ( #1,450,001 of 2,401,723 )
Recent downloads (6 months)
1 ( #551,964 of 2,401,723 )
How can I increase my downloads?
Downloads
Sorry, there are not enough data points to plot this chart.
Sorry, there are not enough data points to plot this chart.