The recursive sets in certain monadic second order fragments of arithmetic
From MaRDI portal
Publication:4088807
Cites work
- scientific article; zbMATH DE number 3128451 (Why is no real title available?)
- scientific article; zbMATH DE number 3492660 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3304995 (Why is no real title available?)
- scientific article; zbMATH DE number 3337664 (Why is no real title available?)
- Büchi's monadic second order successor arithmetic.
- Creative sets
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Definability and decision problems in arithmetic
- Definability in the monadic second-order theory of successor
- Restricted Set-Theoretical Definitions in Arithmetic
- Testing and generating infinite sequences by a finite automaton
- The monadic second order theory of all countable ordinals
- Undecidable theories
Cited in
(6)- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- Weak MSO with the unbounding quantifier
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
- Choice functions and well-orderings over the infinite binary tree
- scientific article; zbMATH DE number 7559440 (Why is no real title available?)
- Decidable Extensions of Church’s Problem
This page was built for publication: The recursive sets in certain monadic second order fragments of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088807)
