معرفی
Dr. Zoltan Kocsis is a mathematical logician and educator based at the University of New South Wales (UNSW), where he currently holds the position of Adjunct Lecturer. His research spans multiple areas including proof theory, nonstandard analysis, category theory, and computational logic, with a focus on logical verification, degree of satisfiability, and structured decompositions.
- PhD in Mathematics from the University of Manchester (2019)
- Adjunct Lecturer at UNSW
- Work with interactive theorem proving software like Agda
Dr. Kocsis' work on degree of satisfiability explores the probability of logical formulas holding in algebraic structures, revealing gaps in equations from Heyting algebras to group theory. His research on structured decompositions and spined categories provides categorical frameworks for fixed-parameter tractability and tree-width generalizations. In formal verification, he contributed to the seL4 kernel on RISC-V architecture.
Recent publications include Proof-theoretic methods in quantifier-free definability (2025), Apartness relations between propositions (2024), and Degree of satisfiability in Heyting algebras (2024). Earlier works cover pseudo-random sequences, homology, and nonstandard analysis in group theory.
He has received the CSIRO SCS Engineering and Technology award (2021) and the IBM Prize (2018) for his contributions to logical satisfiability. His collaborations include work with Ben Bumpus on spined categories and Jade Master on structured decompositions, alongside teams at CSIRO and Tallinn University of Technology.
حوزههای پژوهشی
