Restricted Set-Theoretical Definitions in Arithmetic
From MaRDI portal
Cited in
(16)- On translations of temporal logic of actions into monadic second-order logic
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Tree acceptors and some of their applications
- Composition over the natural number ordering with an extra binary relation
- Decidable Extensions of Church’s Problem
- Decision Problems of Finite Automata Design and Related Arithmetics
- A note on undecidable extensions of monadic second order successor arithmetic
- The recursive sets in certain monadic second order fragments of arithmetic
- Measure quantifier in monadic second order logic
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Undecidability of the first-order arithmetic \(A[P(x),2x,x+1]\)
- The monadic theory of toric words
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
- On the decidability of monadic second-order logic with arithmetic predicates
- On the expansion of monadic second-order logic with Cantor-Bendixson rank and order type predicates
This page was built for publication: Restricted Set-Theoretical Definitions in Arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3848968)
