marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-05-05 09:12:04

Browse source
This commit is contained in:
Marco Realacci 2025-05-05 09:12:04 +02:00
parent 5e8a3d05f1
commit 4a03352005
3 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Concurrent Systems/notes/15 - A formal language for LTSs.md
View file

@ -44,4 +44,4 @@ To simplify the proof, let us modify the set of formulae by allowing conjunction
*Inductive step:* Let's assume the thesis for every tree of height at most h. Let h+1 be the height of $\phi$. Let's distinguish on the outmost operator in $\phi$
![](../../Pasted%20image%2020250505090603.png)
![](../../Pasted%20image%2020250505090959.png)