| Arnon Avron | |
| Native Name: | ארנון אברון |
| Native Name Lang: | he |
| Birth Place: | Tel Aviv, Israel |
| Nationality: | Israeli |
| Fields: | Mathematical logic |
| Workplaces: | Tel Aviv University |
| Alma Mater: | Tel Aviv University Hebrew University of Jerusalem |
| Thesis Title: | The Semantics and Proof Theory of Relevance Logics and Nontrivial Theories Containing Contradictions |
| Thesis Year: | 1985 |
| Doctoral Advisors: | Haim Gaifman |
Arnon Avron (; born 1952) is an Israeli mathematician and Professor at the School of Computer Science at Tel Aviv University. His research focuses on applications of mathematical logic to computer science and artificial intelligence.[1]
Born in Tel Aviv in 1952, Arnon Avron studied mathematics at Tel Aviv University and the Hebrew University of Jerusalem, receiving a Ph.D. magna cum laude from Tel Aviv University in 1985. Between 1986 and 1988, he was a visitor at the University of Edinburgh's Laboratory for Foundations of Computer Science, where he began his association with computer science.[2]
In 1988 he became a senior faculty member of the Department of Computer Science (later School of Computer Science) of Tel Aviv University, chairing the School in 1996–1998, and becoming a Full Professor in 1999.
Avron's research interests include proof theory, automated reasoning, non-classical logics, foundations of mathematics. For example, using analytic geometry he proved the Mohr–Mascheroni theorem.[3] In applying mathematical logic in computer science to artificial intelligence, Avron contributed to the theory of automated reasoning with his introduction of hypersequents, a generalization of the sequent calculus.[4] [5] Avron also introduced the use of bilattices to paraconsistent logic, and made contributions to predicative set theory and geometry.