Iota combinator and implicational propositional calculus
-
03-11-2019 - |
题
There is are two esoteric languages with minimally functionally complete operators, iota and jot, that are closely related to SK combinators. I'm attempting to understand the relationship between these languages and propositional calculus.
We know $K := P → (Q → P)$ and $S := (P → (Q → R)) → ((P → Q) → (P → R))$
My question is this: Is there a relation between iota $λx.xSK$, jot, or iota prime $λx.xKSK$ with Łukasiewicz's axiom system?
$((P → Q) → R) → (R → P) → (S → P)$
没有正确的解决方案
不隶属于 cs.stackexchange