{"id":"palomar/PALOMAR-2026-11-03-000002","url":"https://github.com/Arthur742Ramos/Math-Formalization/tree/0d60a72299f83786929a45a29a2ddc2dba921572/lambda-recursion","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-03-000002-v1.json","repo":"https://github.com/Arthur742Ramos/Math-Formalization","tags":["math.LO","cs.LO"],"score":0,"title":"Recursion and effective inseparability 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":"Proves a uniform recursion theorem for closed lambda numerical semantics and a productive-map effective inseparability result for the closed zero and one numeral languages.","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"}]}