Pith. sign in

REVIEW 1 cited by

The reachability problem for vector addition systems with a stack is not elementary

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1310.1767 v1 pith:JRV26D3U submitted 2013-10-07 cs.FL cs.LO

Ranko Lazic This is my paper · ORCID
classification cs.FLcs.LO
keywords problemadditionelementaryreachabilitystacksystemsvectoradapting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the satisfiability problem for a two-variable first-order logic on trees in which unbounded data may label only leaf nodes. Whether the two problems are decidable remains an open question.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 18 citations worldwide. Full citation record

  1. On the Reachability Problem for Two-Dimensional Branching VASS

    cs.LO 2025-06 accept novelty 8.0 of 10

    The reachability set of every 2-dimensional branching VASS has a computable semilinear representation, so reachability is decidable for this class.

Pith tools