Logical Refinements of Church’s Problem

DOI10.1007/978-3-540-74915-8_9zbMATH Open1179.03038OpenAlexW1553873102MaRDI QIDQ3608405FDOQ3608405

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

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

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)

Cited In (14)

• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Church Synthesis Problem with Parameters

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)