Abstraction in algorithmic logic

DOI10.1007/S10992-007-9051-5MaRDI QIDQ2481241zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• Computer implication and the Curry paradox
• Stability and paradox in algorithmic logic

Cited in

(4)

• scientific article; zbMATH DE number 1942465 (Why is no real title available?)
• Stability and paradox in algorithmic logic
• scientific article; zbMATH DE number 6315451 (Why is no real title available?)
• 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)