-
I am convinced that you don't need to worry about the claim of circularity you mention at the top of the second law article, and I think I can explain why. In your article, you quote the free theorem …
-
With
```
logic OWL
ontology Family1 =
Class: Person
Class: Woman SubClassOf: Person
ObjectProperty: hasChild
Class: Mother EquivalentTo: Woman and hasChild some Person
Individual: mary Typ…
-
[@FroMage] We find that `Void` (the top of the hierarchy) is not adequatly named, since it conveys the idea that it can only point to nothing.
Similarly we find that `Bottom` (the subclass of every t…
-
My theory about why computations don't work well with rational numbers is that the following
definition uses `funextempty` (via `isapropneg`) unnecessarily:
```
Definition intdomnonzerosubmonoid ( X …
-
Important:
- [x] we are showing the diffusion process U is exchangeable, thus conditional iid. Therefore we are testing independence of the diffusion process with the nodal attributes. Make that part …
-
I'm guessing it would be relatively straightforward to extend the `induction` tactic to include support for simultaneous induction, as follows:
`induction on (i1,...,ik)` would introduce an IH wher…
-
This is a subtask of issue #285.
A `PMATCH` expression for expresion `MEM x l` is
```
PMATCH l [
PMATCH_ROW (\(uv:unit). []) (\uv. T) (\uv. F);
PMATCH_ROW (\(y,ys). y::ys) (\(y,ys). x = y) (\(y,…
-
```coq
(* -*- coding: utf-8 -*- *)
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* Prop) :…
-
@gisellemnr
``` scala
val p = LeanCoPParser.getExpansionProof("testing/TSTP/leanCoP/NUM/NUM333+1/leanCoP---2.2.THM-Prf.s.out").get
println(toShallow(p))
println(toDeep(p))
println(extractInstances(p…
-
Symbols and sentences can have the same name. How should we differentiate their loc/ids? There are the following options:
1. forbid symbols and sentences to have the same name
2. rename sentences if t…