3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.LO2026★ 3 cited
The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation
Yoshiki Nakamura
The validity problem for first-order logic is a well-known undecidable problem. The undecidability also holds even for and (equational formulas of) the calculus of r…
cs.FL2016★ 1 cited
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities
Yoshiki Nakamura
We introduce p-equivalence by asymptotic probabilities, which is a weak almost-equivalence based on zero-one laws in finite model theory. In this paper, we consider the computation…