uds-psl/coq-library-undecidability

A library of mechanised undecidability proofs in the Coq proof assistant.

CoqOthercoq
This is stars and forks stats for /uds-psl/coq-library-undecidability repository. As of 29 Mar, 2024 this repository has 96 stars and 24 forks.

Coq Library of Undecidability Proofs The Coq Library of Undecidability Proofs contains mechanised reductions to establish undecidability results in Coq. The undecidability proofs are based on a synthetic approach to undecidability. A problem P is considered undecidable if its decidability in Coq implies the enumerability of the complement of halting problem for Turing machines (SBTM_HALT in TM/SBTM.v). Since the Turing machine halting is enumerable (SBTM_HALT_enum in TM/SBTM_enum.v), enumerability...
Read on GithubGithub Stats Page
repotechsstarsweeklyforksweekly
snu-sf/pacoCoqPythonOther380100
coq-community/lemma-overloadingCoqJavaScriptCSS26060
samih93/e_commerce_appDartOther630280
jyotirmoy-paul/planetsDartC++CMake850320
emacs-ess/ESSEmacs LispROther60601810
alfonsogarciacaro/Feliz.SolidF#Other48010
lanl/FierroGLSLC++Other130100
livekit/livekitGoOther5.8k04750
nathants/libawsGoShellOther438080
google-research/dex-langHaskellPythonJulia1.5k01070