A note on undecidable extensions of monadic second order successor arithmetic

DOI10.1007/BF02280812zbMath0325.02032OpenAlexW2003019252MaRDI QIDQ4088806

Wolfgang Thomas

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/137902

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items

Computational complexity of logical theories of one successor and another unary function, Composition Over the Natural Number Ordering with an Extra Binary Relation, Joining k- and l-recognizable sets of natural numbers, Spectra and satisfiability for logics with successor and a unary function, Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem, The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable, A list of arithmetical structures complete with respect to the first-order definability, The theory of successor with an extra predicate, On the bounded monadic theory of well-ordered structures, Decidable Expansions of Labelled Linear Orderings, Defining Multiplication in Some Additive Expansions of Polynomial Rings

Cites Work

• Unnamed Item
• Restricted Set-Theoretical Definitions in Arithmetic
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Undecidable Extensions of Monadic Second Order Successor Arithmetic