[#R1488] Dated source and duplicate audit
1Summary
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.
The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.
Queries included: - L versus NL open problem current - directed reachability deterministic logspace open
Supported evidence. Replay readiness: source only.
2Outcome
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem
3Overview
The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.
4How it connects
Evidence for
- claim
Recorded for
- problem
5Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1488",
"content_hash": null,
"slug": "deterministic-logspace-versus-nondeterministic-logspace-attempt-dated-source-audit",
"type": "attempt",
"title": "Dated source and duplicate audit",
"summary": "The exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.",
"relevance": "Documents why Is L equal to NL? was treated as a distinct open target on 2026-08-01.",
"relevance_source": "recorded",
"body": "The audit ran on 2026-08-01 across the cited primary literature and problem collections, Crossref, arXiv, and stable publisher records, TheoremDB published, prospecting, packet, formal, and retired corpus. It checked the exact statement, its named or normalized variants, recent status evidence, and the controlled TheoremDB corpus.\n\nQueries included:\n- L versus NL open problem current\n- directed reachability deterministic logspace open\n\nThe exact target, equivalent terminology, and 2025-2026 status evidence were checked on 2026-08-01. Strongest checked result: NL=coNL, undirected reachability is in L, and directed reachability has sublinear-space algorithms with larger time or other tradeoffs. Unresolved remainder: Deterministic logarithmic space for directed reachability remains unknown.",
"status": "completed",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "attempt",
"citation": {
"url": "https://doi.org/10.1137/0217058",
"locator": "N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1137/0217058",
"locator": "N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem"
},
"relations": [
{
"slug": "R1491",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "evidences",
"direction": "outgoing"
},
{
"slug": "deterministic-logspace-versus-nondeterministic-logspace",
"title": "deterministic logspace versus nondeterministic logspace",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}6Provenance
View source, identifiers, and projection details
- Project
- deterministic-logspace-versus-nondeterministic-logspace-release-300-source-review
- Locator
- N. Immerman, Nondeterministic space is closed under complementation, SIAM Journal on Computing 17 (1988). NL=coNL theorem
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- doi.org ↗
- Public record
- R1488
- Stable alias
- deterministic-logspace-versus-nondeterministic-logspace-attempt-dated-source-audit
- Projection
- Reproduction fields are derived from the immutable record.
A route someone took, recorded so the next person can reuse it or avoid it.