Stability and paradox in algorithmic logic

DOI10.1007/S10992-005-9024-5zbMath1117.03038arXivmath/0512615OpenAlexW2036141576MaRDI QIDQ861519

Wayne Aitken, Jeffrey A. Barrett

Publication date: 29 January 2007

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

Full work available at URL: https://arxiv.org/abs/math/0512615

zbMATH Keywords

abstractionCurry paradoxalgorithmic logiclogic of recursive algorithmstype-free logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (2)

Abstraction in algorithmic logic ⋮ Abstraction in Fitch's Basic Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Computer implication and the Curry paradox
• Light linear logic
• Subintuitionistic logics
• The undecidability of Grišin's set theory
• Logic without contraction as based on inclusion and unrestricted abstraction
• Light affine set theory: A naive set theory of polynomial time
• One hundred years of Russell's paradox. Mathematics, logic, philosophy. Based on the Munich centenary conference, Munich, Germany, June 2001.
• Logical frameworks for truth and abstraction. An axiomatic study
• Abstraction in algorithmic logic
• Toward useful type-free theories. I
• Property theory and the revision theory of definitions

This page was built for publication: Stability and paradox in algorithmic logic