IA Scholar Query: Äquivalenz und Reduktion bei linearen nichtdeterministischen Automaten.
https://scholar.archive.org/
Internet Archive Scholar query results feedeninfo@archive.orgSun, 06 Feb 2022 00:00:00 GMTfatcat-scholarhttps://scholar.archive.org/help1440Der Code der Mathematik
https://scholar.archive.org/work/hfhz6w4v3bdubli7qmypoffgb4
This text summarizes and expands the content of a general audience talk given in 2018 at the University of Mainz. Motivated by recent developments in dependent type theory and infinity category theory, it presents a history of ideas around the concepts of truth, proof, equality, and equivalence as well as their relation to human thought. We describe a few selected ideas of Platon, Aristoteles, Leibniz, Kant, Frege and others and then pass to the results of G\"odel and Tarski about incompleteness, undecidability and truth in deductive systems and their semantic models. The main focus of this text, however, is the development of dependent type theory through the work of Per Martin--L\"of and recent developments in homotopy type theory, i.e., the univalent foundations program of Vladimir Voevodsky and others. These theories allow the notion of identity types, which gives new possibilities for handling equality, symmetry, equivalence and isomorphisms in a conceptual way. Martin--L\"of type theories have semantic models in (infinity,1)-categories, which are related to simplicial localizations of Quillen model categories. The interaction of type theory with infinity category theory is a new paradigm for a structural view on mathematics which is superior to set theory. It also supports the recent emerging trend for computer assisted proofs in mathematics and verification of algorithms and software in computer science.Stefan Müller-Stachwork_hfhz6w4v3bdubli7qmypoffgb4Sun, 06 Feb 2022 00:00:00 GMT