Abstraction in algorithmic logic

DOI10.1007/S10992-007-9051-5zbMATH Open1142.03018OpenAlexW1988686825MaRDI QIDQ2481241FDOQ2481241

Authors: Wayne Aitken, Jeffrey A. Barrett 

Publication date: 9 April 2008

Published in: Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10992-007-9051-5

Recommendations

• Stability and paradox in algorithmic logic
• Curry's paradox in contractionless constructive logic
• Compact bracket abstraction in combinatory logic
• scientific article; zbMATH DE number 5081447
• Logic without contraction as based on inclusion and unrestricted abstraction

zbMATH Keywords

Curry paradoxCurry fixed pointfunctional abstraction principletype-free algorithmic logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability and paradox in algorithmic logic
• Computer implication and the Curry paradox

Cited In (4)

• Title not available (Why is that?)
• Stability and paradox in algorithmic logic
• Title not available (Why is that?)
• Abstraction in Fitch's basic logic

This page was built for publication: Abstraction in algorithmic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481241)