Logical Refinements of Church’s Problem

DOI10.1007/978-3-540-74915-8_9MaRDI QIDQ3608405zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Logic in computer science (03B70)

Recommendations

• Solution of Church's problem: a tutorial
• The Church synthesis problem with metric
• Church’s Problem and a Tour through Automata Theory
• Synthesis of finite-state and definable winning strategies
• Decidable Extensions of Church’s Problem

Cited in

(14)

• Church Synthesis Problem with Parameters
• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
• scientific article; zbMATH DE number 7594201 (Why is no real title available?)
• Languages versus \(\omega\)-languages in regular infinite games
• Alonzo Church's Contributions to Philosophy and Intensional Logic
• The Church synthesis problem with metric
• Solution of Church's problem: a tutorial
• Fine hierarchies and m-reducibilities in theoretical computer science
• scientific article; zbMATH DE number 7770056 (Why is no real title available?)
• Church’s Problem and a Tour through Automata Theory
• Facets of Synthesis: Revisiting Church’s Problem
• On the affirmative solution to Salem's problem
• Reactive synthesis from interval temporal logic specifications
• LMSO: a Curry-Howard approach to Church's synthesis via linear logic

This page was built for publication: Logical Refinements of Church’s Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608405)