Tarski's influence on computer science

@article{Feferman2005TarskisIO,
  title={Tarski's influence on computer science},
  author={S. Feferman},
  journal={20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)},
  year={2005},
  pages={342-}
}
  • S. Feferman
  • Published 2005
  • Computer Science, Mathematics
  • 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
Summary form only given. The great logician Alfred Tarski played one of the leading roles in the development of mathematical logic in the twentieth century, as much for the programs he promoted and the conceptual organization of the subject as for his many important results. Except for his fixed-point theorem, Tarski's influence on computer science has been largely indirect but nevertheless substantial. The author surveys this influence through his work in the areas of decision procedures… Expand
Contribution of Warsaw Logicians to Computational Logic
A relation-algebraic approach to the "Hoare logic" of functional dependencies
  • J. Oliveira
  • Computer Science, Mathematics
  • J. Log. Algebraic Methods Program.
  • 2014
Pointfree foundations for (generic) lossless decomposition
Functions as types or the "Hoare logic" of functional dependencies
Logic for physical space
Alloy Meets the Algebra of Programming: A Case Study
Automated deduction for verification
Minkowski Games
Performance of a Quaternary Logic Design
Design of High Performance Quaternary Adders
...
1
2
...

References

SHOWING 1-10 OF 85 REFERENCES
Applications of Alfred Tarski's Ideas in Database Theory
The axiom of elementary sets on the edge of Peircean expressibility
Alfred Tarski: Life and Logic
Little engines of proof
  • N. Shankar
  • Computer Science
  • Proceedings 17th Annual IEEE Symposium on Logic in Computer Science
  • 2002
Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Quantifier elimination for real closed fields by cylindrical algebraic decomposition--preliminary report
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic
  • D. Oppen
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1978
Three-variable statements of set-pairing
...
1
2
3
4
5
...