-
I ran `search * 'T.'` and `search * 'F.'` in `set.mm` and found a lot of theorems which are not in `iset.mm` yet. The vast majority hold intuitionistically, and the proofs probably aren't especially h…
-
I think we should rename some of the numbered axioms. "ax-6" doesn't really hint at what it is, and the axioms aren't presented in that order in mmset.raw.html. The risk of renaming is that we miss so…
-
We now have a definition (`df-xor`) and a number of theorems concerning exclusive or.
I'm tagging this as `good first issue` since some of it is definitely easy (and the rest probably is, but might…
-
```
Functional programming is not only about composing functions
and algebraic data structures --- it makes concurrency composable ---
something that's virtually impossible with other programming p…
-
There is a section of set.mm (currently 1.8.3) which proves statements of predicate logic which are theorems in set.mm but axioms in iset.mm.
We should do the same for propositional logic (this wou…
-
The discussion so far has been in #316 and #349 but neither one is exactly about the project of adding intuitionistic exclusive-or. I'm tagging this as `good first issue` because I think some of it is…
-
To remove one venue for undecidability, the [SLS 5.1.5](https://www.scala-lang.org/files/archive/spec/2.13/05-classes-and-objects.html#inheritance-closure) mandates a restriction (implemented by scala…
-
We are one distinct variable constraint away from having these. See [sbco2v](http://us2.metamath.org:88/ileuni/sbco2v.html), [hbsbv](http://us2.metamath.org:88/ileuni/hbsbv.html), and [sbco3v](http://…
-
That is, do we want an axiom of the sort `A. x x = y \/ -. A. x x = y`?
Another option is `A. x x = y \/ F/_ x y` because `A. x x = y \/ -. A. x x = y` has some possibly undesirable decidability st…
-
As discussed in some comments on #350 it would be good to have a notation for decidability. This can be used as an antecedent or a hypothesis (which probably will be a more graceful way to display cla…