Decidable Expansions of Labelled Linear Orderings

DOI10.2168/LMCS-7(2:5)2011zbMath1213.03017arXiv1102.2232OpenAlexW1902289782MaRDI QIDQ5892516

Alexis Bès, Alexander Rabinovich

Publication date: 26 May 2011

Published in: Logical Methods in Computer Science, Fields of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.2232

zbMATH Keywords

monadic second-order logicdecidabilitydefinabilitylinear orderings

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Total orders (06A05)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic uses of the Feferman-Vaught theorem
• Nonmaximal decidable structures
• The monadic theory of order
• The monadic theory of morphic infinite words and generalizations
• On decidability of monadic logic of order over the naturals extended by monadic predicates
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
• The monadic theory of ω₂
• Interpreting second-order logic in the monadic theory of order
• Weakly maximal decidable structures
• Model Transformations in Decidability Proofs for Monadic Theories
• Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
• Restricted Set-Theoretical Definitions in Arithmetic
• Modest theory of short chains. I
• Modest theory of short chains. II
• A note on undecidable extensions of monadic second order successor arithmetic
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Decidable Expansions of Labelled Linear Orderings