coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: Yannick Forster <forster AT ps.uni-saarland.de>
- To: coq-club AT inria.fr
- Subject: Re: [Coq-Club] FOL or SOL formalization in Coq
- Date: Mon, 17 Dec 2018 22:30:24 +0100
- Authentication-results: mail3-smtp-sop.national.inria.fr; spf=None smtp.pra=forster AT ps.uni-saarland.de; spf=Pass smtp.mailfrom=forster AT ps.uni-saarland.de; spf=None smtp.helo=postmaster AT theia.rz.uni-saarland.de
- Ironport-phdr: 9a23:Iyk16B+uCIbh3v9uRHKM819IXTAuvvDOBiVQ1KB31+4cTK2v8tzYMVDF4r011RmVBdWds6oMotGVmpioYXYH75eFvSJKW713fDhBt/8rmRc9CtWOE0zxIa2iRSU7GMNfSA0tpCnjYgBaF8nkelLdvGC54yIMFRXjLwp1Ifn+FpLPg8it2O2+557ebx9UiDahfLh/MAi4oQLNu8cMnIBsMLwxyhzHontJf+RZ22ZlLk+Nkhj/+8m94odt/zxftPw9+cFAV776f7kjQrxDEDsmKWE169b1uhTFUACC+2ETUmQSkhpPHgjF8BT3VYr/vyfmquZw3jSRMMvrRr42RDui9b9mRh/1hikZOT4382/ZhcJ/g61ZvB2vqAdyw5LWbYyPKPZyYq3QcNEcSGFcXshRTStBAoakYoQNFeUBO+BYr4jhqFsNsBCwBQ6sBPn0yj9UmHD2x7Ax3uMvEQHBxgwgBM4Ov2rOrNjuLKcSSvq5zLTOzTXCdv9Wwi3y55LSchAlu/6MW69/fdDMxkYxDg7IiEibp4LiPzOQzOsNsm6b4vJ9WuKoim4rsQZxoiKgxss0hYnJh54VylDZ9Spi2oo6Odq4SEtjbd65FptQtjiWN5BsTcw4WWFovDw1yrsbtpKhYScF1pIqzAPcZfyfa4WE/xzuWemLLTp8hX9pYrCyiwy8/ES90uHxVcu53ExXoiZbnNTArG4B2wDT58SdSfZx4kGs0iuV2Q/J8OFLO0U0mLLbK5E/xr4wkYIesVjDHiDomUX5lrWadl8l++Sy9uTnZLTmqoaHN4BukA7+KKAulda5AeslKAQBQnaU9fy91L3l40L5XK1HguA4n6TWqpzXIcUWqrS7DgNP3Isv9g6zDzK839QZmXkHIkhFeBWCj4XxNVHOJ+r4Deyjg1uyijdm3OjGPqb7DpXQKHjDka7tfa1n5EFG0gozycpQ55RJBb0bPf38RFf9tMbEAR8hLwy03+HnBc1h2YMZQGKDG7OWMKfPsVCT/e8vOOmNZIoNuDnnMfQl5vjujWU4mVAHZ6Wp04EXOziEGaFtJFzcan7xiP8AF30Lt0wwVr/EklqHBA9aYXCzVKF0yDYhE56rF8+XSIe3m6CMxg+jBdtLYGEDEVmFC3PhcYnCV/paO3HaGdNojjFRDevpcIQmzxz77FarmYoiFfLd/2gjjbym0dF04+PJkhRorW5sFIKA1WDIVGh9hGcBQTNw0K0t+BUhmGfG6rBxhrljLfIW/+lACF9oLYWa0up7Tsv7UxjFd9GFDlqrEI3/XGMBC+kpytpLWH5TXtWviheZgXi2A7IUnvqRFtop9KOZxHH4PcJ0zXqA2KRz11Q=
Hi Francisco,
we have a paper on undecidability results related to first-order logic at the upcoming CPP conference, coming with a formalisation of FOL in Coq:
Yannick Forster, Dominik Kirst, Gert Smolka: On Synthetic Undecidability in Coq, with an Application to the Entscheidungsproblem (https://www.ps.uni-saarland.de/extras/fol-undec/)
Besides the work of Russell O'Connor that Cody mentioned there are also substantial formalisations by Hugo Herbelin and Gyesik Lee, for instance covered in
Hugo Herbelin, SunYoung Kim, Gyesik Lee: Formalizing
the meta-theory of first-order predicate logic (https://doi.org/10.4134/JKMS.j160546, https://github.com/liganega/trace)
Hope that helps!
Yannick
--
PhD student, Programming Systems Lab, Saarland University
https://www.ps.uni-saarland.de/~forster/
On 17/12/2018 16:39, Francisco Trucco wrote:
Hi all,
I was wondering if any of you knew of a*first order logic or second order logic formalization in Coq*. In particular, I am looking for something similar to Coq in Coq <https://github.com/coq-contribs/coq-in-coq> but with FOL or SOL.
Thanks a lot!
Francisco Trucco
- [Coq-Club] FOL or SOL formalization in Coq, Francisco Trucco, 12/17/2018
- Re: [Coq-Club] FOL or SOL formalization in Coq, roux cody, 12/17/2018
- Re: [Coq-Club] FOL or SOL formalization in Coq, Milad Ketabii, 12/17/2018
- Re: [Coq-Club] FOL or SOL formalization in Coq, Yannick Forster, 12/17/2018
- Re: [Coq-Club] FOL or SOL formalization in Coq, roux cody, 12/17/2018
Archive powered by MHonArc 2.6.18.