Paraconsistent intelligent systems of computer logics

DOI10.1007/BF01068641zbMath0752.03004OpenAlexW2041775475MaRDI QIDQ4007390

A. S. Kuzichev

Publication date: 27 September 1992

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01068641

zbMATH Keywords

applicative computation systemsbounded cut ruleGentzen-deductive extensions of Church's \(\lambda\)-conversion calculiSchönfinkel-Curry pure combinatory logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Cut-elimination and normal-form theorems (03F05) Paraconsistent logics (03B53) Combinatory logic and lambda calculus (03B40)

Cites Work

• A conservative extension of a formal arithmetic
• Consistent extensions of pure combinatory logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Paraconsistent intelligent systems of computer logics