Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
If, as Peirce showed us, predicate logic can represented by his Beta system of existential graphs, and if predicate logic is some kind of truncation of dependent type theory, should there not be a diagrammatic calculus for the latter too? Recall that the Beta graphs proved useful for representing indexed monoidal categories.
When Peirce represents the negation of a proposition, , by writing enclosed in a circle, are we seeing a representation of the type , as though we’re looking through to a symbol of absurdity? It looks like we’d want to take an intuitionistic version of Peirce, perhaps something like the one constructed by Oostra.
Those are great questions, David. All I can say for the moment is that the “line of separation” was, for Peirce, a threshold so that passing into the circle was akin to entering a hypothetical world. There are glimmers of the same idea that one can use when dealing with lax natural transformations, where one passes through a semi-permeable membrane.
Peirce’s original laws for Beta have to be teased apart to get workable versions for intuitionistic logic. I’ve never considered such a calculus for dependent types (although I have, a bit, for higher-order logic). That would be an interesting project, I think.
One step would be to think about how dependent product truncates into universal quantification and then implication. I wonder how one might handle the difference between term and type. Presumably there would need to be something as sophisticated as ways of representing, say, beta reduction from the lambda calculus. That points to things like sharing graphs.
1 to 3 of 3