pith. sign in

Title resolution pending

· 2009 · arXiv 0270.149027

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
read on arXiv browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1 cs.LO 1

years

2026 2

verdicts

UNVERDICTED 2

clear filters

representative citing papers

On the Reachability Problem on Monoid-Labelled Undirected Graphs

cs.CC · 2026-06-19 · unverdicted · novelty 7.0

Establishes L membership for identity acceptors, all F in commutative monoids, and L(R)-commutative UoG monoids, plus NL-completeness dichotomies for BA2 and U, using product graphs and Green's relations.

Syntactic Systems Cannot See Semantic Invariants

cs.LO · 2026-06-15 · unverdicted · novelty 6.0

Closes the missing direction of an open question on incomparability of two induction theories via a short syntactic argument and extracts the Syntactic Invariance Principle.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • On the Reachability Problem on Monoid-Labelled Undirected Graphs cs.CC · 2026-06-19 · unverdicted · none · ref 33

    Establishes L membership for identity acceptors, all F in commutative monoids, and L(R)-commutative UoG monoids, plus NL-completeness dichotomies for BA2 and U, using product graphs and Green's relations.