Analytic combinatory calculi and the elimination of transitivity
type: Item
instance of: scholarly article
title: Analytic combinatory calculi and the elimination of transitivity
zbMATH Open document ID: 1060.03033
author: Pierluigi Minari
published in: Archive for Mathematical Logic
publication date: 2004-09-22T00:00:00Z
review text: 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.
reviewed by: Martin W. Bunder
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 2102096
zbMATH Keywords: combinatory logic
zbMATH Keywords: extensionality
zbMATH Keywords: equational logic
zbMATH Keywords: transitivity
MaRDI profile type: Publication
full work available at URL: s00153-003-0203-1
OpenAlex ID: W2149904043
DOI: 10.1007/S00153-003-0203-1
description: scientific article; zbMATH DE number 2102096