Decidable Extensions of Church’s Problem

DOI10.1007/978-3-642-04027-6_31zbMath1257.03034OpenAlexW1582633789MaRDI QIDQ3644764

Alexander Rabinovich

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_31

zbMATH Keywords

Church synthesis problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (3)

Realizability problem for constraint LTL ⋮ The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates ⋮ Decidable Extensions of Church’s Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monadic theory of order
• The monadic theory of morphic infinite words and generalizations
• Automata, logics, and infinite games. A guide to current research
• On decidability of monadic logic of order over the naturals extended by monadic predicates
• The first order properties of products of algebraic systems
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
• Decidable Extensions of Church’s Problem
• Restricted Set-Theoretical Definitions in Arithmetic
• The recursive sets in certain monadic second order fragments of arithmetic
• The Church Synthesis Problem with Parameters
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Solving Sequential Conditions by Finite-State Strategies
• Finite automata and the logic of one-place predicates

This page was built for publication: Decidable Extensions of Church’s Problem