Delphi.science

Computability theory for closed lambda programs

Arthur Freitas Ramos, David Barros Hulak, Ruy José Guerra Barretto de Queiroz

Palomar Registrypalomar/PALOMAR-2026-11-01-000031Nov 1, 2026math.LOscore 0

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.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-01-000031
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000031/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-01-000031/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'