Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case
From MaRDI portal
Publication:6314373
arXiv1902.07794MaRDI QIDQ6314373
Publication date: 20 February 2019
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
This page was built for publication: Characterizing Strongly First Order Dependencies: The Non-Jumping Relativizable Case