2000 character limit reached
Non determinism through type isomorphism
Published 29 Mar 2013 in cs.LO | (1303.7334v1)
Abstract: We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
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.