{"id":"palomar/PALOMAR-2026-11-03-000007","url":"https://github.com/Arthur742Ramos/Math-Formalization/tree/b6eb1988de2ddf8794eb3c3781eb34bc37f2bc7a/lambda-myhill","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-03-000007-v1.json","repo":"https://github.com/Arthur742Ramos/Math-Formalization","tags":["math.LO","cs.LO"],"score":0,"title":"Productive closed lambda languages and one-one completeness","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 a non-extensional creative-to-one-one completeness argument for predicates on closed lambda syntax, using uniform finite avoidance and computable fresh-output selection.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-03","reactions":{},"formalized":true,"formalizes":[{"title":"Computability theory","identifier":"https://math.berkeley.edu/~marks/notes/computability_notes_v1.pdf","relationship":"adapts"}]}