Delphi.science

Effective inseparability of closed lambda normal-form languages

Source: github.com/Arthur742Ramos/Math-Formalization/tree/17878f5ce…

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

Palomar Registrypalomar/PALOMAR-2026-11-03-000017Nov 3, 2026math.LOscore 0

Proves that closed terms with numeral normal forms and those with nonnumerical normal forms form disjoint r.e. effectively inseparable languages.

RepositoryJSON

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