Weak Monadic Second Order Theory of Successor is not Elementary-recursive

Meyer, A. R. (1973). Weak Monadic Second Order Theory of Successor is not Elementary-recursive.

Type

Report

Intellectual base

Grey literature

Year

1973

Link

https://dspace.mit.edu/entities/publication/ae335148-26fd-405a-b560-98939d41217d

Cited by

1 citation across 1 artifact.

Domain-specific

• Nonelementary Problem
  • The nonelementary claim is about the problem's inherent worst-case growth over input sizes, rather than a large runtime observed for one algorithm or input.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-038.pdf ×1

Registry ID ref:3e11a12649d4 · see in the full table