Expressibility in a restricted second-order arithmetic

DOI10.1007/BF00967200zbMath0409.03035MaRDI QIDQ1258737

A. A. Nabebin

Publication date: 1978

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

DefinabilityExpressibilityMonadic Second Order Successor ArithmeticPredicates Representable By AutomataWeak Second Order Arithmetic

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

Semi-synchronous transductions

Cites Work

• Unnamed Item
• Büchi's monadic second order successor arithmetic.
• Decision Problems of Finite Automata Design and Related Arithmetics
• Undefinability of Addition from One Unary Operator

This page was built for publication: Expressibility in a restricted second-order arithmetic