Delphi.science

Effective Rice–Shapiro theorem for closed lambda programs

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

Palomar Registrypalomar/PALOMAR-2026-11-02-000021Nov 2, 2026math.LOscore 0

Characterizes recursively enumerable extensional numerical properties of closed full-beta lambda programs by effectively enumerable families of finite graph tables, with finite-witness and extension consequences.

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-02-000021
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-02-000021/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-02-000021/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'