An axiom system for the weak monadic second order theory of two successors
From MaRDI portal
Publication:1253650
DOI10.1007/BF02761075zbMath0397.03009WikidataQ114693416 ScholiaQ114693416MaRDI QIDQ1253650
Publication date: 1978
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (2)
Cites Work
- The monadic second order theory of all countable ordinals
- Tree acceptors and some of their applications
- Weak Second‐Order Arithmetic and Finite Automata
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An axiom system for the weak monadic second order theory of two successors