The recursive sets in certain monadic second order fragments of arithmetic

DOI10.1007/BF02280817zbMATH Open0325.02033MaRDI QIDQ4088807FDOQ4088807

Authors: 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)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
• Title not available (Why is that?)
• Choice functions and well-orderings over the infinite binary tree
• Weak MSO with the unbounding quantifier
• 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)