The recursive sets in certain monadic second order fragments of arithmetic

DOI10.1007/BF02280817zbMath0325.02033MaRDI QIDQ4088807

Dirk Siefkes

Publication date: 1975

Published in: Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137907

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

Choice functions and well-orderings over the infinite binary tree ⋮ The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates ⋮ Weak MSO with the unbounding quantifier ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable Extensions of Church’s Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The monadic second order theory of all countable ordinals
• Büchi's monadic second order successor arithmetic.
• Undecidable theories
• Restricted Set-Theoretical Definitions in Arithmetic
• Definability in the monadic second-order theory of successor
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Definability and decision problems in arithmetic
• Creative sets

This page was built for publication: The recursive sets in certain monadic second order fragments of arithmetic