2026-07-02T11:17:46Z

Tim Lyon:

{{Neuigkeit
|Titel DE=Hannes Straß erhält Lehrpreis des Fachschaftsrats für „Algorithmische Spieltheorie"
|Titel EN=Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory"
|Beschreibung DE=Hannes Straß, Wissenschaftler in der Arbeitsgruppe Computational Logic am ICCL, hat den Lehrpreis des Fachschaftsrats in der Kategorie „Beste Wahlpflichtveranstaltung" für seine Vorlesung „Algorithmische Spieltheorie" erhalten.
<br>
Der Preis wurde im Rahmen der OUTPUT.DD-Veranstaltung der Fakultät verliehen. Die Lehrpreise des Fachschaftsrats würdigen herausragende Lehre auf Grundlage studentischer Bewertungen, wobei verschiedene Kategorien Exzellenz in unterschiedlichen Veranstaltungsformaten auszeichnen.

Herzlichen Glückwunsch, Hannes!
|Beschreibung EN=Hannes Straß, who is a researcher in the Computational Logic Group at the ICCL, has received the Student Council's teaching award in the category "Best Elective" for his lecture "Algorithmic Game Theory."
<br>
The award was presented at the department's OUTPUT.DD event. The Student Council's teaching awards recognize outstanding teaching as evaluated by students, with categories honoring excellence across different course formats.

Congratulations Hannes!
|Datum=2026-07-02
|Bild=Pic hannes.jpeg
|Forschungsgruppe=Computational Logic
}}

News111

2026-07-02T11:17:22Z

Tim Lyon:

{{Neuigkeit
|Titel DE=Hannes Straß erhält Lehrpreis des Fachschaftsrats für „Algorithmische Spieltheorie"
|Titel EN=Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory"
|Beschreibung DE=Hannes Straß, Wissenschaftler in der Arbeitsgruppe Computational Logic am ICCL, hat den Lehrpreis des Fachschaftsrats in der Kategorie „Beste Wahlpflichtveranstaltung" für seine Vorlesung „Algorithmische Spieltheorie" erhalten.
<br>

Der Preis wurde im Rahmen der OUTPUT.DD-Veranstaltung der Fakultät verliehen. Die Lehrpreise des Fachschaftsrats würdigen herausragende Lehre auf Grundlage studentischer Bewertungen, wobei verschiedene Kategorien Exzellenz in unterschiedlichen Veranstaltungsformaten auszeichnen.

Herzlichen Glückwunsch, Hannes!
|Beschreibung EN=Hannes Straß, who is a researcher in the Computational Logic Group at the ICCL, has received the Student Council's teaching award in the category "Best Elective" for his lecture "Algorithmic Game Theory."
<br>

The award was presented at the department's OUTPUT.DD event. The Student Council's teaching awards recognize outstanding teaching as evaluated by students, with categories honoring excellence across different course formats.

Congratulations Hannes!
|Datum=2026-07-02
|Bild=Pic hannes.jpeg
|Forschungsgruppe=Computational Logic
}}

News111

2026-07-02T11:16:46Z

Tim Lyon:

{{Neuigkeit
|Titel DE=Hannes Straß erhält Lehrpreis des Fachschaftsrats für „Algorithmische Spieltheorie"
|Titel EN=Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory"
|Beschreibung DE=Hannes Straß, Wissenschaftler in der Arbeitsgruppe Computational Logic am ICCL, hat den Lehrpreis des Fachschaftsrats in der Kategorie „Beste Wahlpflichtveranstaltung" für seine Vorlesung „Algorithmische Spieltheorie" erhalten. <br>

Der Preis wurde im Rahmen der OUTPUT.DD-Veranstaltung der Fakultät verliehen. Die Lehrpreise des Fachschaftsrats würdigen herausragende Lehre auf Grundlage studentischer Bewertungen, wobei verschiedene Kategorien Exzellenz in unterschiedlichen Veranstaltungsformaten auszeichnen.

Herzlichen Glückwunsch, Hannes!
|Beschreibung EN=Hannes Straß, who is a researcher in the Computational Logic Group at the ICCL, has received the Student Council's teaching award in the category "Best Elective" for his lecture "Algorithmic Game Theory." <br>

The award was presented at the department's OUTPUT.DD event. The Student Council's teaching awards recognize outstanding teaching as evaluated by students, with categories honoring excellence across different course formats.

Congratulations Hannes!
|Datum=2026-07-02
|Bild=Pic hannes.jpeg
|Forschungsgruppe=Computational Logic
}}

News111

2026-07-02T11:15:46Z

Tim Lyon: Die Seite wurde neu angelegt: „{{Neuigkeit |Titel DE=Hannes Straß erhält Lehrpreis des Fachschaftsrats für „Algorithmische Spieltheorie" |Titel EN=Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory" |Beschreibung DE=Hannes Straß, Wissenschaftler in der Arbeitsgruppe Computational Logic am ICCL, hat den Lehrpreis des Fachschaftsrats in der Kategorie „Beste Wahlpflichtveranstaltung" für seine Vorlesung „Algorithmische Spieltheorie" erhalten.…“

{{Neuigkeit
|Titel DE=Hannes Straß erhält Lehrpreis des Fachschaftsrats für „Algorithmische Spieltheorie"
|Titel EN=Hannes Straß Receives Student Council Teaching Award for "Algorithmic Game Theory"
|Beschreibung DE=Hannes Straß, Wissenschaftler in der Arbeitsgruppe Computational Logic am ICCL, hat den Lehrpreis des Fachschaftsrats in der Kategorie „Beste Wahlpflichtveranstaltung" für seine Vorlesung „Algorithmische Spieltheorie" erhalten.

Der Preis wurde im Rahmen der OUTPUT.DD-Veranstaltung der Fakultät verliehen. Die Lehrpreise des Fachschaftsrats würdigen herausragende Lehre auf Grundlage studentischer Bewertungen, wobei verschiedene Kategorien Exzellenz in unterschiedlichen Veranstaltungsformaten auszeichnen.

Herzlichen Glückwunsch, Hannes!
|Beschreibung EN=Hannes Straß, who is a researcher in the Computational Logic Group at the ICCL, has received the Student Council's teaching award in the category "Best Elective" for his lecture "Algorithmic Game Theory."

The award was presented at the department's OUTPUT.DD event. The Student Council's teaching awards recognize outstanding teaching as evaluated by students, with categories honoring excellence across different course formats.

Congratulations Hannes!
|Datum=2026-07-02
|Bild=Pic hannes.jpeg
|Forschungsgruppe=Computational Logic
}}

Datei:Pic hannes.jpeg

2026-07-02T11:10:00Z

Tim Lyon:

Proof Theory and Sequent Systems (SS2026)

2026-06-19T07:32:11Z

Tim Lyon:

{{Vorlesung
|Title=Proof Theory and Sequent Systems
|Research group=Computational Logic
|Lecturers=Tim Lyon
|Term=SS
|Year=2026
|Module=INF-25-Ma-FTK-ASAI, INF-BAS2, INF-VERT2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====Course Description===

Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal proofs. Typically, proofs are defined as syntactic objects inductively constructible through applications of inference rules to a given set of assumptions, axioms, or previously constructed proofs. Since proofs are built by means of inference rules, which manipulate formulae and symbols, proof theory is syntactic in nature, making proof systems well-suited for logical reasoning in a computational environment.

In this course, we will study fundamental concepts and techniques in proof theory, focusing in particular on sequent systems for propositional logic, first-order logic, and modal logic. We will discuss concepts such as admissible rules, invertible rules, cut elimination, and proof-search, as well as consider questions such as: How can we verify that a sequent system correctly captures a paradigm of logical reasoning? What techniques can be used to transform proofs into proofs of a desired shape? How can we mine proofs to extract additional information beyond the theorem being proved? How can we leverage a proof system for automated reasoning, which can be carried out by a computer?

===Prerequisites===

Students are expected to be familiar with propositional logic. Familiarity with first-order logic or modal logic is helpful, but not necessary.

===Course Plan===

The course will take place on Fridays 11:10 – 12:40 in room APB E001. The first class will take place on 17 April 2026.

===Examination===

There will be an oral examination at the end of the course. To obtain a slot, please contact the instructor Dr. Tim Lyon by email.
|Literature=*The course script can be downloaded from the following website: [https://sites.google.com/view/timlyon/teaching?authuser=0 [Link to Script]]
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-04-17
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-04-24
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-05-08
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-05-22
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-06-05
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-06-12
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-06-19
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-06-26
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-07-03
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture
|Room=APB E001
|Date=2026-07-17
|DS=DS3
}}

Tim Lyon:

{{Vorlesung
|Title=Proof Theory and Sequent Systems
|Research group=Computational Logic
|Lecturers=Tim Lyon
|Term=SS
|Year=2026
|Module=INF-25-Ma-FTK-ASAI, INF-BAS2, INF-VERT2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====Course Description===

Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal proofs. Typically, proofs are defined as syntactic objects inductively constructible through applications of inference rules to a given set of assumptions, axioms, or previously constructed proofs. Since proofs are built by means of inference rules, which manipulate formulae and symbols, proof theory is syntactic in nature, making proof systems well-suited for logical reasoning in a computational environment.

In this course, we will study fundamental concepts and techniques in proof theory, focusing in particular on sequent systems for propositional logic, first-order logic, and modal logic. We will discuss concepts such as admissible rules, invertible rules, cut elimination, and proof-search, as well as consider questions such as: How can we verify that a sequent system correctly captures a paradigm of logical reasoning? What techniques can be used to transform proofs into proofs of a desired shape? How can we mine proofs to extract additional information beyond the theorem being proved? How can we leverage a proof system for automated reasoning, which can be carried out by a computer?

===Prerequisites===

Students are expected to be familiar with propositional logic. Familiarity with first-order logic or modal logic is helpful, but not necessary.

===Course Plan===

The course will take place on Fridays 11:10 – 12:40 in room APB E001. The first class will take place on 17 April 2026.

===Examination===

There will be an oral examination at the end of the course. To obtain a slot, please contact the instructor Dr. Tim Lyon by email.
|Literature=*The course script can be downloaded from the following website: [https://sites.google.com/view/timlyon/teaching?authuser=0 [Link to Script]]
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E001
|Date=2026-04-17
|DS=DS3
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E001
|Date=2026-04-24
|DS=DS3
}}

Proof Theory and Sequent Systems (SS2026)

2026-03-28T09:56:18Z

Tim Lyon: Die Seite wurde neu angelegt: „{{Vorlesung |Title=Proof Theory and Sequent Systems |Research group=Computational Logic |Lecturers=Tim Lyon |Term=SS |Year=2026 |Module=INF-25-Ma-FTK-ASAI, INF-BAS2, INF-VERT2 |SWSLecture=2 |SWSExercise=0 |SWSPractical=0 |Exam type=mündliche Prüfung |Description====Course Description=== Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal proofs. Typically, proofs are defined as synt…“

Proof Theory and Sequent Systems (WS2025)

2026-03-28T09:45:29Z

Tim Lyon:

{{Vorlesung
|Title=Proof Theory and Sequent Systems
|Research group=Computational Logic
|Lecturers=Tim Lyon
|Term=WS
|Year=2025
|Module=INF-25-Ma-FTK-ASAI, INF-BAS2, INF-VERT2
|SWSLecture=2
|SWSExercise=0
|SWSPractical=0
|Exam type=mündliche Prüfung
|Description====Course Description===

Proof theory serves as one of the central pillars of mathematical logic and concerns the study and application of formal proofs. Typically, proofs are defined as syntactic objects inductively constructible through applications of inference rules to a given set of assumptions, axioms, or previously constructed proofs. Since proofs are built by means of inference rules, which manipulate formulae and symbols, proof theory is syntactic in nature, making proof systems well-suited for logical reasoning in a computational environment.

In this course, we will study fundamental concepts and techniques in proof theory, focusing in particular on sequent systems for propositional logic, first-order logic, and modal logic. We will discuss concepts such as admissible rules, invertible rules, cut elimination, and proof-search, as well as consider questions such as: How can we verify that a sequent system correctly captures a paradigm of logical reasoning? What techniques can be used to transform proofs into proofs of a desired shape? How can we mine proofs to extract additional information beyond the theorem being proved? How can we leverage a proof system for automated reasoning, which can be carried out by a computer?

===Prerequisites===

Students are expected to be familiar with propositional logic. Familiarity with first-order logic or modal logic is helpful, but not necessary.

===Course Plan===

The course will take place on Fridays 9:20 – 10:50 in room APB E007. The first class will take place on 24 October 2025.

===Examination===

There will be an oral examination at the end of the course. To obtain a slot, please contact the instructor Dr. Tim Lyon by email.
|Literature=*The course script can be downloaded from the following website: [https://sites.google.com/view/timlyon/teaching?authuser=0 [Link to Script]]
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 1
|Room=APB E007
|Date=2025-10-24
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 2
|Room=APB E007
|Date=2025-11-07
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 3
|Room=APB E007
|Date=2025-11-14
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 4
|Room=APB E007
|Date=2025-11-21
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 5
|Room=APB E007
|Date=2025-11-28
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 6
|Room=APB E007
|Date=2025-12-05
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 7
|Room=APB E007
|Date=2025-12-12
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 8
|Room=APB E007
|Date=2025-12-19
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 9
|Room=APB E007
|Date=2026-01-09
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 10
|Room=APB E007
|Date=2026-01-16
|DS=DS2
}}
{{Vorlesung Zeiten
|Lehrveranstaltungstype=Vorlesung
|Title=Lecture 11
|Room=APB E007
|Date=2026-01-23
|DS=DS2
}}

Thema3519

2026-02-26T11:29:48Z

Tim Lyon:

{{Abschlussarbeit
|Titel DE=Master's Thesis Projects in Symbolic Logic, Proof Theory, and Theorem Proving
|Titel EN=Master's Thesis Projects in Symbolic Logic, Proof Theory, and Theorem Proving
|Abschlussarbeitstyp=Master
|Betreuer=Tim Lyon
|Forschungsgruppe=Computational Logic
|Abschlussarbeitsstatus=Offen
|Ergebnisse=Thesis Topics Lyon.pdf
|Beschreibung DE=<h2>Overview</h2>
<p>
I supervise Master’s thesis projects in areas related to <strong>symbolic logic, proof theory, and automated reasoning</strong>. Students interested in formal methods, non-classical logics, decision procedures, verification, or theorem proving are encouraged to contact me to discuss potential projects.
</p>
<p>Research topics can range from foundational studies in logic to practical implementation of reasoning tools. Examples include, but are not limited to:</p>

<ul>
<li>Study and implementation of proof calculi for non-classical logics.</li>
<li>Theoretical investigations of non-classical logics used in computer science and knowledge representation.</li>
<li>Investigation of decision algorithms, proof search strategies, and complexity results.</li>
<li>Development of theorem provers for modal or related logics.</li>
<li>Study and verification (e.g., in Ada/SPARK) of proof transformation algorithms.</li>
</ul>

<h2>Getting in Touch</h2>
<p>
If you are interested in undertaking a thesis project in any of the areas listed above, or wish to propose a related project of your own, please contact me via email to discuss possible topics:
</p>

<ul>
<li><strong>Email:</strong> timothy_stephen.lyon@tu-dresden.de</li>
<li><strong>Office:</strong> APB 2031, Andreas-Pfitzmann-Bau, Fakultät für Informatik, TU Dresden</li>
</ul>

<p>In your email, please briefly introduce yourself, indicate your degree program, and mention any prior experience in logic, programming, or formal methods.</p>

<h2>Further Information</h2>
<p>
Note that the above information is included in a PDF, which can be downloaded with the "download" link on this webpage. For further information, including research interests, descriptions of past projects, and related resources, please see my research page: https://sites.google.com/view/timlyon/home?authuser=0
</p>
|Beschreibung EN=<h2>Overview</h2>
<p>
I supervise Master’s thesis projects in areas related to <strong>symbolic logic, proof theory, and automated reasoning</strong>. Students interested in formal methods, non-classical logics, decision procedures, verification, or theorem proving are encouraged to contact me to discuss potential projects.
</p>
<p>Research topics can range from foundational studies in logic to practical implementation of reasoning tools. Examples include, but are not limited to:</p>

<ul>
<li>Study and implementation of proof calculi for non-classical logics.</li>
<li>Theoretical investigations of non-classical logics used in computer science and knowledge representation.</li>
<li>Investigation of decision algorithms, proof search strategies, and complexity results.</li>
<li>Development of theorem provers for modal or related logics.</li>
<li>Study and verification (e.g., in Ada/SPARK) of proof transformation algorithms.</li>
</ul>

<h2>Getting in Touch</h2>
<p>
If you are interested in undertaking a thesis project in any of the areas listed above, or wish to propose a related project of your own, please contact me via email to discuss possible topics:
</p>

<ul>
<li><strong>Email:</strong> timothy_stephen.lyon@tu-dresden.de</li>
<li><strong>Office:</strong> APB 2031, Andreas-Pfitzmann-Bau, Fakultät für Informatik, TU Dresden</li>
</ul>

<p>In your email, please briefly introduce yourself, indicate your degree program, and mention any prior experience in logic, programming, or formal methods.</p>

<h2>Further Information</h2>
<p>
Note that the above information is included in a PDF, which can be downloaded with the "download" link on this webpage. For further information, including research interests, descriptions of past projects, and related resources, please see my research page: https://sites.google.com/view/timlyon/home?authuser=0
</p>
}}

Thema3519

2026-02-26T11:29:10Z

Tim Lyon:

{{Abschlussarbeit
|Titel DE=Master's Thesis Projects in Symbolic Logic, Proof Theory, and Theorem Proving
|Titel EN=Master's Thesis Projects in Symbolic Logic, Proof Theory, and Theorem Proving
|Abschlussarbeitstyp=Master
|Betreuer=Tim Lyon
|Forschungsgruppe=Computational Logic
|Abschlussarbeitsstatus=Offen
|Ergebnisse=Thesis Topics Lyon.pdf
|Beschreibung DE=<h2>Overview</h2>
<p>
I supervise Master’s thesis projects in areas related to <strong>symbolic logic, proof theory, and automated reasoning</strong>. Students interested in formal methods, non-classical logics, decision procedures, verification, or theorem proving are encouraged to contact me to discuss potential projects.
</p>
<p>Research topics can range from foundational studies in logic to practical implementation of reasoning tools. Examples include, but are not limited to:</p>

<ul>
<li>Study and implementation of proof calculi for non-classical logics.</li>
<li>Theoretical investigations of non-classical logics used in computer science and knowledge representation.</li>
<li>Investigation of decision algorithms, proof search strategies, and complexity results.</li>
<li>Development of theorem provers for modal or related logics.</li>
<li>Study and verification (e.g., in Ada/SPARK) of proof transformation algorithms.</li>
</ul>

<h2>Getting in Touch</h2>
<p>
If you are interested in undertaking a thesis project in any of the areas listed above, or wish to propose a related project of your own, please contact me via email to discuss possible topics:
</p>

<ul>
<li><strong>Email:</strong> <a href="mailto:timothy_stephen.lyon@tu-dresden.de">timothy_stephen.lyon@tu-dresden.de</a></li>
<li><strong>Office:</strong> APB 2031, Andreas-Pfitzmann-Bau, Fakultät für Informatik, TU Dresden</li>
</ul>

<p>In your email, please briefly introduce yourself, indicate your degree program, and mention any prior experience in logic, programming, or formal methods.</p>

<h2>Further Information</h2>
<p>
Note that the above information is included in a PDF, which can be downloaded with the "download" link on this webpage. For further information, including research interests, descriptions of past projects, and related resources, please see my research page: <a href="https://sites.google.com/view/timlyon/home?authuser=0">https://sites.google.com/view/timlyon/home?authuser=0</a>
</p>
|Beschreibung EN=<h2>Overview</h2>
<p>
I supervise Master’s thesis projects in areas related to <strong>symbolic logic, proof theory, and automated reasoning</strong>. Students interested in formal methods, non-classical logics, decision procedures, verification, or theorem proving are encouraged to contact me to discuss potential projects.
</p>
<p>Research topics can range from foundational studies in logic to practical implementation of reasoning tools. Examples include, but are not limited to:</p>

<ul>
<li>Study and implementation of proof calculi for non-classical logics.</li>
<li>Theoretical investigations of non-classical logics used in computer science and knowledge representation.</li>
<li>Investigation of decision algorithms, proof search strategies, and complexity results.</li>
<li>Development of theorem provers for modal or related logics.</li>
<li>Study and verification (e.g., in Ada/SPARK) of proof transformation algorithms.</li>
</ul>

<h2>Getting in Touch</h2>
<p>
If you are interested in undertaking a thesis project in any of the areas listed above, or wish to propose a related project of your own, please contact me via email to discuss possible topics:
</p>

<ul>
<li><strong>Email:</strong> timothy_stephen.lyon@tu-dresden.de</li>
<li><strong>Office:</strong> APB 2031, Andreas-Pfitzmann-Bau, Fakultät für Informatik, TU Dresden</li>
</ul>

<p>In your email, please briefly introduce yourself, indicate your degree program, and mention any prior experience in logic, programming, or formal methods.</p>

<h2>Further Information</h2>
<p>
Note that the above information is included in a PDF, which can be downloaded with the "download" link on this webpage. For further information, including research interests, descriptions of past projects, and related resources, please see my research page: <a href="https://sites.google.com/view/timlyon/home?authuser=0">https://sites.google.com/view/timlyon/home?authuser=0</a>
</p>
}}

Thema3519

2026-02-26T11:26:24Z

2026-02-26T11:17:24Z

Tim Lyon:

Thema3519

2026-02-26T11:14:16Z

Tim Lyon: