Lei Liu completed her Master’s degree with the project title Complexity of Options in 2017.
An extension to monotone options (pictured) was presented at
ALH-2018. The new paper is called The number of languages with maximum state complexity and has been accepted for TAMC 2019.
As of 2022, the paper has been through 7 revisions and has been accepted for publication in the journal Algebra Universalis.
Some of the 168 monotone Boolean functions of 4 variables
After Jake Fennick’s MA project in the proof assistant Isabelle in 2019, I have advised two Master’s students whose project focused on another popular proof assistant, Lean:
- Hugh Chou, 2021: Formalizing my paper on a conflict in the Carmo and Jones approach to contrary-to-duty deontic obligations.
- Ryan T. Sasaki, 2022: Formalizing a time-invariance theorem for Redington immunization in financial mathematics.
Some recent departmental service I have enjoyed being involved in includes:
- Associate Chair (since 2021)
- Personnel committee chair (2020-2021)
- Hiring committee chair (2019-2020)
There are a couple of items under service to the profession as well:
- Editor, Journal of Logic and Analysis (since 2019)
- Moderator, CS Theory Stack Exchange (since 2018)
I gave a talk in the online seminar “Computability Theory and Applications” on November 17, 2020, on
Normalized Information Distance and Jaccard distance
The paper, with Niraula and Yoon, was published in Logical Foundations of Computer Science
Watch this space for updates on logic courses.
The undergraduate course MATH 454 (Axiomatic Set Theory) was taught in Fall 2021. Textbook: Schimmerling’s “A course on set theory”
A similar course at the graduate level was MATH 654 Fall 2020, which had the following readings:
- Foundations of Mathematics, Kenneth Kunen, parts of chapters I-IV.
- Modal logic for open minds, Johan van Benthem, some of chapters 1-11 and 16.
- Logic and Proof, Lean tutorial, and The Natural Number Game
Math 654 in Fall 2022 will use the textbook by Ebbinghaus, Flum, and Thomas and some readings about Lean.
Three new papers
with graduate students Birns (left) and Webb (right).
- KL-randomness and effective dimension under strong reducibility (with David J. Webb). Computability in Europe, Lectures Notes in Computer Science, 2021.
- On the degrees of constructively immune sets (with Samuel D. Birns). Computability in Europe, Lectures Notes in Computer Science, 2021.
- Strong Medvedev reducibilities and the KL-randomness problem (with David J. Webb). Computability in Europe, Lectures Notes in Computer Science, 2022.
This new 42,000 USD grant from the Simons Foundation will support travel and collaboration during 2020-2025.
Pictured: Angsheng Li announcing TAMC 2020 in Changsha, China during TAMC 2019 in Kitakyushu, Japan.