Analytic combinatory calculi and the elimination of transitivity (Q1879319)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2102096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analytic combinatory calculi and the elimination of transitivity |
scientific article; zbMATH DE number 2102096 |
Statements
Analytic combinatory calculi and the elimination of transitivity (English)
0 references
22 September 2004
0 references
The author of this paper develops a system of combinatory equality, which is equivalent to standard systems, but does not require the transitivity rule. The new system allows a very simple proof of the Church-Rosser property and a simpler proof of the leftmost reduction theorem. When extensionality is added to the new equational system however, transitivity is no longer provable, although it still is for some weaker systems such as BCK combinatory-equality.
0 references
combinatory logic
0 references
extensionality
0 references
equational logic
0 references
transitivity
0 references
0.8391417860984802
0 references
0.8286415338516235
0 references
0.8216472268104553
0 references
0.7995174527168274
0 references
0.7564584612846375
0 references
