Non determinism through type isomorphism
classification
💻 cs.LO
keywords
propositionssystemalgebraicdefinedeterminismequivalenceequivalentisomorphism
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.