Decidable expansions of labelled linear orderings

Alexis Bès; Alexander Rabinovich

doi:10.2168/LMCS-7(2:5)2011

Decidable expansions of labelled linear orderings

Alexis Bès
, Alexander Rabinovich

School of Computer Science and AI

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type ω or -ω, and the monadic second order theory of the combined structure is decidable, there exists a non-trivial expansion by a further monadic predicate that is still decidable.

Original language	English GB
Journal	Logical Methods in Computer Science
Volume	7
Issue number	2
DOIs	https://doi.org/10.2168/LMCS-7(2:5)2011
State	Published - 2011

Keywords

Decidability
Definability
Linear orderings
Monadic second-order logic

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.2168/LMCS-7(2:5)2011

Cite this

@article{da77f300f3734f7c8d9be7b62139a02d,

title = "Decidable expansions of labelled linear orderings",

abstract = "Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type ω or -ω, and the monadic second order theory of the combined structure is decidable, there exists a non-trivial expansion by a further monadic predicate that is still decidable.",

keywords = "Decidability, Definability, Linear orderings, Monadic second-order logic",

author = "Alexis B{\`e}s and Alexander Rabinovich",

year = "2011",

doi = "10.2168/LMCS-7(2:5)2011",

language = "الإنجليزيّة",

volume = "7",

journal = "Logical Methods in Computer Science",

issn = "1860-5974",

publisher = "Logical Methods in Computer Science",

number = "2",

}

TY - JOUR

T1 - Decidable expansions of labelled linear orderings

AU - Bès, Alexis

AU - Rabinovich, Alexander

PY - 2011

Y1 - 2011

N2 - Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type ω or -ω, and the monadic second order theory of the combined structure is decidable, there exists a non-trivial expansion by a further monadic predicate that is still decidable.

AB - Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type ω or -ω, and the monadic second order theory of the combined structure is decidable, there exists a non-trivial expansion by a further monadic predicate that is still decidable.

KW - Decidability

KW - Definability

KW - Linear orderings

KW - Monadic second-order logic

UR - https://www.scopus.com/pages/publications/79960437413

U2 - 10.2168/LMCS-7(2:5)2011

DO - 10.2168/LMCS-7(2:5)2011

M3 - مقالة

SN - 1860-5974

VL - 7

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 2

ER -

Decidable expansions of labelled linear orderings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this