{"id":"palomar/PALOMAR-2026-11-01-000031","url":"https://github.com/Arthur742Ramos/Math-Formalization/tree/236c361f809b2004cde6ecbed679c864bd16ee90/lambda-theory","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-01-000031-v1.json","repo":"https://github.com/Arthur742Ramos/Math-Formalization","tags":["math.LO","cs.LO"],"score":0,"title":"Computability theory for closed lambda programs","trust":"high","domain":"math.LO","source":"palomar","authors":["Arthur Freitas Ramos","David Barros Hulak","Ruy José Guerra Barretto de Queiroz"],"reviews":0,"subject":"math.LO","summary":"Formalizes recursively enumerable completeness of full-beta Church-numeral reachability, an extensional Rice theorem, and a computable universal-existential normal-form completeness theorem for numerical totality of closed untyped lambda programs.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-01","reactions":{},"formalized":true,"formalizes":[{"title":"Formalizing Computability Theory via Partial Recursive Functions","identifier":"https://doi.org/10.4230/LIPIcs.ITP.2019.12","relationship":"adapts"}]}