Besides someone mentioning at the very start of the talk that I shouldn't stutter, it went rather fine and in the end had some really constructive criticism.. So I'm sure you will do well.
@evinda Hm, interesting. That's why I couldn't identify it. We don't ever do that. So in order to check efficiency of code you should translate it to a real one?
I've had a question that bothered me the entire day. If I have a set of sentences $\Delta$ that is satisfiable, so that for every sentence $\phi \notin \Delta$, $\Delta \cup \phi$ is not satisfiable, then $\Delta$ has a unique model. So, it feels like this $\Delta$ is some maximal satisfiable set.
I thought to show that for every attomic sentence $A_i$, either $A_i \in \Delta$ or $\neg(A_i)\in \Delta$. But it's not necesserily true, I'd think
@Studentmath I'm rusty on thinking about this, but... one of $A_i$ and $\not A_i$ is true in the unique model of $\Delta$. Suppose $A_i$ is; then $A_i \in \Delta$, since otherwise $\Delta \cup A_i$ is satisfiable (by $\Delta$'s model), contradicting your hypothesis. No?
