Logical Refinements of Church’s Problem
From MaRDI portal
Publication:3608405
DOI10.1007/978-3-540-74915-8_9zbMath1179.03038OpenAlexW1553873102MaRDI QIDQ3608405
Alexander Rabinovich, Wolfgang Thomas
Publication date: 5 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_9
Games involving graphs (91A43) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Unnamed Item, LANGUAGES VERSUS ω-LANGUAGES IN REGULAR INFINITE GAMES, Fine hierarchies and m-reducibilities in theoretical computer science, Facets of Synthesis: Revisiting Church’s Problem, Reactive synthesis from interval temporal logic specifications
