Büchi's monadic second order successor arithmetic.

DOI10.1007/978-3-662-36678-3zbMath0399.03011OpenAlexW563652063MaRDI QIDQ1254240

Dirk Siefkes

Publication date: 1970

Published in: Lecture Notes in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-36678-3

zbMATH Keywords

DefinabilityCategoricityBuechi's Monadic Second Order Successor ArithmeticDecidable TheoriesFinite AutomataPeano AxiomsQuantifiers EliminationRestricted Recursion FormulaeUltimately Periodic Sets of Natural Numbers

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10) Categoricity and completeness of theories (03C35)

Related Items (7)

Complementing deterministic Büchi automata in polynomial time ⋮ The recursive sets in certain monadic second order fragments of arithmetic ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Expressibility in a restricted second-order arithmetic ⋮ Logic, semigroups and automata on words ⋮ A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time ⋮ The structure of the models of decidable monadic theories of graphs

This page was built for publication: Büchi's monadic second order successor arithmetic.