2000 character limit reached
Propositional calculus with multiple negations
Published 3 Nov 2024 in math.LO | (2411.01627v1)
Abstract: In this document, we will build a logical calculus that is a generalization of classical propositional logic but contains a finite multiplicity of negations weaker than classical negation. In this way, we can introduce contradictions in this new system without it becoming inconsistent.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.