2000 character limit reached
Sequent Calculi for some subintuitionistic Logics
Published 27 Oct 2024 in math.LO | (2410.20425v1)
Abstract: This Paper investigate sequent calculi for certain weak subintuitionistic logics. We establish that weakening and contraction are height-preserving admissible for each of these calculi, and we provide a syntactic proof for the admissibility of the cut rule for most of these sequent calculi. We also demonstrate the equivalence of these calculi to their corresponding axiomatic systems, thereby confirming their soundness and completeness with respect to neighbourhood semantics.
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.