About Logic - Theorem Proving, Constructive Mathematics and Type Theory

It's going to be a regular podcast with Thorsten Altenkirch and Deniz Sarikaya, and this is episode one:

19:51 On Synthetic Homotopy Theory. See Synthetic Homotopy Theory with HoTT/UF.

See https://github.com/agda/agda.

See also FOMUS: Foundations of Mathematics: Univalent Foundations and Set Theory - What are Suitable Criteria for the Foundations of Mathematics?Emily Riehl on Univalent Foundations and Another Excellent Talk on HoTT by Steve Awodey

And another episode:

22:02 On the use of computers in theorem proving. You can get a situation where a hugely complex lemma is formally proven and turns out to be useful in proving a perfectly intelligible theorem, but the proof is unintelligible because it relies on this incomprehensible lemma. 

And another:

My comment:

10:50 His job was done?! What about reproducibility? If you formally prove some theorem in one system, and a hundred other people run the same code through the same system, just on different computers, is that really enough? Don't you need to formally describe the Lean prover in such a way that anyone else can write their own theorem prover and run the same proofs? So the next step would be to formally specify a specification language and use that to formally describe the Lean type system, then you need to formally specify a language for writing expressions and another for specifying type checkers and then people can translate these axiom systems and type checkers into actual running code on whatever hardware they want. Until you do that you aren't really proving theorems, you're just playing around with a computer program. The discussion at 24:27 on axioms is relevant here. [See also Thorsten's comments about constructivism at 21:43 in the first discussion.] Also the discussion at 35:58 on definitions. You don't need to go as far as the reals to see the issue. Even the implementation of pairing in set theory "shows through". See the 1999 paper Final Coalgebras as Greatest Fixed Points in ZF Set Theory by Lawrence C. Paulson.

Subscribe to About Logic

Comments

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Hitachi HD44780U LCD Display Fonts

Using Pipewire to Make A Music Synthesizer