TL;DR
This paper reviews how Alfred Tarski's foundational work in logic, algebra, and semantics has significantly influenced various areas of computer science, including decision procedures and formal language semantics.
Contribution
It provides a comprehensive survey of Tarski's work and its fundamental impact on multiple domains within computer science.
Findings
Tarski's decision procedures influenced algebra and geometry algorithms.
The method of quantifier elimination advanced formal language analysis.
Model-theoretic preservation theorems underpin modern logical frameworks.
Abstract
The influence of Alfred Tarski on computer science was indirect but significant in a number of directions and was in certain respects fundamental. Here surveyed is the work of Tarski on the decision procedure for algebra and geometry, the method of elimination of quantifiers, the semantics of formal languages, modeltheoretic preservation theorems, and algebraic logic; various connections of each with computer science are taken up.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.