Variations on a theme of Curry

DOI10.1305/ndjfl/1143468315zbMath1107.03018OpenAlexW1995420085MaRDI QIDQ2505136

Lloyd Humberstone

Publication date: 4 October 2006

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1143468315

zbMATH Keywords

classical propositional logicconservative extensionfixed-pointsCurry's paradoxtruth functionsBCI logic

Mathematics Subject Classification ID

Classical propositional logic (03B05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items

2007 Annual Meeting of the Association for Symbolic Logic ⋮ Logical consequence and the paradoxes ⋮ On the algebraizability of the implicational fragment of abelian logic

Cites Work

• Computer implication and the Curry paradox
• The consistency of the axiom of comprehension in the infinite-valued predicate logic of Lukasiewicz
• Basic properties of the equivalence
• The simple consistency of a set theory based on the logic CSQ
• A consistent theory of attributes in a logic without contraction
• Note about Lukasiewicz's theorem concerning the system of axioms of the implicational propositional calculus
• Four paradoxes
• How to be really contraction free
• The finite model property for BCK and BCIW
• Substructural logics: a primer
• Logic without contraction as based on inclusion and unrestricted abstraction
• Naïve comprehension and contracting implications
• Routes to triviality
• Light affine set theory: A naive set theory of polynomial time
• Studies on the axiom of comprehension
• Equational logic
• A proof of a theorem of Lukasiewicz
• A warning about the choice of primitive operators in modal logic
• The finite model property for BCI and related systems
• Investigations on a comprehesnion axiom without negation in the defining propositional functions
• Finite Models of Some Substructural Logics
• A Set Theory Based on a Certain 3-Valued Logic.
• Algebraizable logics
• The correspondence between cut-elimination and normalization
• Some Properties of Linear Logic Proved by Semantic Methods
• Formulas for which contraction is admissible
• A Variation on a Paradox
• Relative necessity
• Logical paradoxes for many-valued systems
• The pleasures of anticipation: Enriching intuitionistic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item