{{Short description|Israeli mathematician}} {{Infobox scientist | name = Arnon Avron | native_name = ארנון אברון | native_name_lang = he | image = <!--(filename only, i.e. without "File:" prefix)--> | image_size = | caption = | birth_name = <!-- if different from "name" --> | birth_date = {{Birth year and age|1952}} | birth_place = Tel Aviv, Israel | fields = Mathematical logic | workplaces = Tel Aviv University | alma_mater = Tel Aviv University<br>Hebrew University of Jerusalem | thesis_title = The Semantics and Proof Theory of Relevance Logics and Nontrivial Theories Containing Contradictions | thesis_url = | thesis_year = 1985 | doctoral_advisors = Haim Gaifman<br>{{ill|Yoram Hirschfeld|he|יורם הירשפלד}} | awards = }}
'''Arnon Avron''' ({{Langx|he|ארנון אברון}}; 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.<ref>{{cite web|url=https://www.cs.tau.ac.il/~aa/|title=Arnon Avron|website=Tel Aviv University|access-date=19 February 2019}}</ref>
==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.<ref name=foreward>{{cite journal|first1=Ofer|last1=Arieli|first2=Beata|last2=Konikowska|first3=Alexander|last3=Rabinovich|first4=Anna|last4=Zamansky|title=Foreword|journal=Journal of Logic and Computation|volume=2|issue=1|date=2016|pages=1–6|doi=10.1093/logcom/ext023}}</ref>
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.{{r|foreward}}
==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.<ref>Arnon Avron (1990) [https://link.springer.com/article/10.1007/BF01222890 "On strict strong constructibility with a compass alone"], ''Journal of Geometry'' 38: 12.</ref> 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.<ref>{{cite book|first1=Arnon|last1=Avron|chapter=The method of hypersequents in the proof theory of propositional non-classical logics|title=Logic: From Foundations to Applications|pages=1–32|publisher=Clarendon Press|location=New York|date=1996|isbn=978-0-19-853862-2|editor1-first=Wilfrid|editor1-last=Hodges|editor1-link=Wilfrid Hodges|editor2-first=Martin|editor2-last=Hyland|editor2-link=Martin Hyland|editor3-first=Charles|editor3-last=Steinhorn|editor4-first=John|editor4-last=Truss|chapter-url=https://www.cs.tau.ac.il/~aa/articles/hypersequents.pdf}}</ref><ref>{{cite journal|title=Hypersequents, logical consequence and intermediate logics for concurrency|first=Arnon|last=Avron|journal=Annals of Mathematics and Artificial Intelligence|date=1991|volume=4|issue=3–4|pages=225–248|doi=10.1007/BF01531058|s2cid=9610134 }}</ref> Avron also introduced the use of bilattices to paraconsistent logic, and made contributions to predicative set theory and geometry.{{r|foreward}}
==Selected works== ===Books=== * {{cite book|first=Arnon|last=Avron|title=Introduction to Discrete Mathematics|language=he|publisher=Tel Aviv University Press|location=Tel Aviv|date=2001|url=https://books.google.com/books?id=QC7HDAEACAAJ}} * {{cite book|first=Arnon|last=Avron|title=Gödel's Theorems and the Problem of the Foundations of Mathematics|language=he|series=Broadcast University Series|publisher=Ministry of Defense Publications|location=Israel|date=1998|url=https://simania.co.il/bookdetails.php?item_id=16951}}
===Articles=== <!--* {{cite journal|first1=Arnon|last1=Avron|first2=Iddo|last2=Lev|doi=10.1093/logcom/exi001|title=Non-deterministic multiple-valued structures|journal=Journal of Logic and Computation|volume=15|issue=3|date=2005|pages=241–261|url=https://ieeexplore.ieee.org/document/8210155}}--> * {{cite book|first1=Arnon|last1=Avron|chapter=The method of hypersequents in the proof theory of propositional non-classical logics|title=Logic: From Foundations to Applications|pages=1–32|publisher=Clarendon Press|location=New York|date=1996|isbn=978-0-19-853862-2|editor1-first=Wilfrid|editor1-last=Hodges|editor1-link=Wilfrid Hodges|editor2-first=Martin|editor2-last=Hyland|editor2-link=Martin Hyland|editor3-first=Charles|editor3-last=Steinhorn|editor4-first=John|editor4-last=Truss|chapter-url=https://www.cs.tau.ac.il/~aa/articles/hypersequents.pdf}} <!--* {{cite journal|title=Reasoning with logical bilattices|author1-first=Ofer|author1-last=Arieli|author2-first=Arnon|author2-last=Avron|journal=Journal of Logic, Language and Information|date=1996|volume=5|issue=1|pages=25–63|url=https://link.springer.com/article/10.1007/BF00215626|doi=10.1007/BF00215626}}--> * {{cite journal|first1=Arnon|last1=Avron|first2=Furio|last2=Honsell|first3=Ian A.|last3=Mason|first4=Robert|last4=Pollack|doi=10.1007/BF00245294|title=Using typed lambda calculus to implement formal systems on a machine|journal=Journal of Automated Reasoning|date=1992|volume=9|issue=3|pages=309–354|s2cid=2528793 }} * {{cite journal|first=Arnon|last=Avron|doi=10.2307/2274919|title=Natural 3-valued logics—characterization and proof theory|journal=The Journal of Symbolic Logic|date=1991|volume=56|issue=1|pages=276–294|jstor=2274919|s2cid=15084999 |citeseerx=10.1.1.638.9332}} * {{cite journal|title=Hypersequents, logical consequence and intermediate logics for concurrency|first=Arnon|last=Avron|journal=Annals of Mathematics and Artificial Intelligence|date=1991|volume=4|issue=3–4|pages=225–248|doi=10.1007/BF01531058|s2cid=9610134 }} * {{cite journal|first=Arnon|last=Avron|title=The semantics and proof theory of linear logic|journal=Theoretical Computer Science|volume=57|issue=2–3|date=1988|pages=161–184|doi=10.1016/0304-3975(88)90037-0|citeseerx=10.1.1.29.9}}
==References== {{Reflist}}
{{authority control}}
{{DEFAULTSORT:Avron, Arnon}} Category:1952 births Category:Living people Category:Einstein Institute of Mathematics alumni Category:Israeli computer scientists Category:Israeli Jews Category:Israeli mathematicians Category:Mathematical logicians Category:Tel Aviv University alumni Category:Academic staff of Tel Aviv University