Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
type: Item
instance of: scholarly article
title: Combinatory abstraction using \({\mathbf B}\), \({\mathbf B}^ \prime\) and friends
zbMATH Open document ID: 0838.03012
DOI: 10.1016/0304-3975(94)90114-7
author: Peter Trigg
author: J. Roger Hindley
author: Martin W. Bunder
published in: Theoretical Computer Science
publication date: 1995-04-06T00:00:00Z
Mathematics Subject Classification ID: 03B40
zbMATH DE Number: 741095
zbMATH Keywords: combinatory basis
zbMATH Keywords: combinatory completeness
zbMATH Keywords: abstractability
zbMATH Keywords: complete basis
zbMATH Keywords: partial basis
zbMATH Keywords: abstraction algorithm
zbMATH Keywords: deduction theorem
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90114-7
OpenAlex ID: W2030827886
cites work: Q4085699
cites work: Algebraizable logics
cites work: Q5565113
cites work: A system of formal logic without an analogue to the curry W operator
cites work: Standard and Normal Reductions
cites work: Q4722037
cites work: Solution to the P − W problem
cites work: Notes on the axiomatics of the propositional calculus
cites work: Q3691634
description: scientific article; zbMATH DE number 741095