Biography:Arnon Avron
Arnon Avron | |
|---|---|
ארנון אברון | |
| Born | 1952 (age 71–72) |
| Nationality | Israeli |
| Alma mater | Tel Aviv University Hebrew University of Jerusalem |
| Scientific career | |
| Fields | Mathematical logic |
| Institutions | Tel Aviv University |
| Thesis | The Semantics and Proof Theory of Relevance Logics and Nontrivial Theories Containing Contradictions (1985) |
| Doctoral advisors | Haim Gaifman Yoram Hirschfeld (he) |
Arnon Avron (Hebrew: ארנון אברון; 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]
Biography
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.[2]
Research
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.[2]
Selected works
Books
- Avron, Arnon (2001) (in he). Introduction to Discrete Mathematics. Tel Aviv: Tel Aviv University Press. https://books.google.com/books?id=QC7HDAEACAAJ.
- Avron, Arnon (1998) (in he). Gödel's Theorems and the Problem of the Foundations of Mathematics. Broadcast University Series. Israel: Ministry of Defense Publications. https://simania.co.il/bookdetails.php?item_id=16951.
Articles
- Avron, Arnon (1996). "The method of hypersequents in the proof theory of propositional non-classical logics". in Hodges, Wilfrid; Hyland, Martin; Steinhorn, Charles et al.. Logic: From Foundations to Applications. New York: Clarendon Press. pp. 1–32. ISBN 978-0-19-853862-2. https://www.cs.tau.ac.il/~aa/articles/hypersequents.pdf.
- Avron, Arnon; Honsell, Furio; Mason, Ian A.; Pollack, Robert (1992). "Using typed lambda calculus to implement formal systems on a machine". Journal of Automated Reasoning 9 (3): 309–354. doi:10.1007/BF00245294.
- Avron, Arnon (1991). "Natural 3-valued logics—characterization and proof theory". The Journal of Symbolic Logic 56 (1): 276–294. doi:10.2307/2274919.
- Avron, Arnon (1991). "Hypersequents, logical consequence and intermediate logics for concurrency". Annals of Mathematics and Artificial Intelligence 4 (3–4): 225–248. doi:10.1007/BF01531058.
- Avron, Arnon (1988). "The semantics and proof theory of linear logic". Theoretical Computer Science 57 (2–3): 161–184. doi:10.1016/0304-3975(88)90037-0.
References
- ↑ "Arnon Avron". https://www.cs.tau.ac.il/~aa/.
- ↑ 2.0 2.1 2.2 Arieli, Ofer; Konikowska, Beata; Rabinovich, Alexander; Zamansky, Anna (2016). "Foreword". Journal of Logic and Computation 2 (1): 1–6. doi:10.1093/logcom/ext023.
- ↑ Arnon Avron (1990) "On strict strong constructibility with a compass alone", Journal of Geometry 38: 12.
- ↑ Avron, Arnon (1996). "The method of hypersequents in the proof theory of propositional non-classical logics". in Hodges, Wilfrid; Hyland, Martin; Steinhorn, Charles et al.. Logic: From Foundations to Applications. New York: Clarendon Press. pp. 1–32. ISBN 978-0-19-853862-2. https://www.cs.tau.ac.il/~aa/articles/hypersequents.pdf.
- ↑ Avron, Arnon (1991). "Hypersequents, logical consequence and intermediate logics for concurrency". Annals of Mathematics and Artificial Intelligence 4 (3–4): 225–248. doi:10.1007/BF01531058.
 |  |
