Added missing abstract, fixed typo in styling

index.html

@@ -57,13 +57,13 @@ <h3>Programme</h3>
         <p style="margin-left: 25px;">We present a connection-based tableaux theorem prover that performs inferences entirely on the GPU. Benchmarks on the m40 dataset show it performs worse than other provers in terms of proving power. In terms of inferences per second, however, it is on par with or even surpassing state-of-the-art provers on similarly priced and dated hardware, despite it lacking various important optimizations that are present in the other provers. On top of this prover, we designed and implemented a heuristic neural network-based system that avoids evaluations during the computation of inferences, and instead pre-computes the results of these evaluations.</p>
         </details></li>
 	<li><details><summary>[15:00-15:30] Wouter Fransen, Grothendieck Topologies on the Category of Finite Probability Spaces</summary>
-        <p style="margin-left: 25px;">TBA</p>
+        <p style="margin-left: 25px;">In this talk, I will present the results from my Bachelor project. The goal of this project was to get a better understanding of category-theoretic concepts like Grothendieck topologies and sheaves, by looking at their incarnations for a concrete example: the category Prob of finite probability spaces. Our main question was, can we find a “non-trivial” Grothendieck topology on Prob? And if so, are they subcanonical?</p>
         </details></li>
     </ul>
         <p style="margin-left: 40px;"><em>break (30 min)</em></p>
     <ul style="list-style-type: none;">
         <li>[16:00-17:00] Replacement programme: Workshop on Models for Synthetic Calculus</li>
-	<li><details><summary><s>Valentina Castiglioni, On the Axiomatisation of Weak Bisimulation-based Congruences over CCS<\s> (canceled)</summary>
+	<li><details><summary><s>Valentina Castiglioni, On the Axiomatisation of Weak Bisimulation-based Congruences over CCS</s> (canceled)</summary>
         <p style="margin-left: 25px;">In this talk we will discuss some of our achievements on the equational theory of (the restriction, relabelling, and recursion free fragment of) CCS modulo four classic bisimulation-based notions of equivalence that abstract from internal computational steps in process behaviour, i.e., the rooted versions of branching, $\eta$, delay, and weak bisimilarities.</p>
         </details></li>
         <li><details><summary><s>Bálint Kocsis, Normalization for simply typed lambda-calculus</s> (canceled)</summary>