Stability and paradox in algorithmic logic
From MaRDI portal
Publication:861519
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
Related Items (2)
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