New proof of the solvability of the elementary theory of linearly ordered sets

DOI10.1007/BF01158085MaRDI QIDQ923067zbMATH OpenOpenAlexFDO

Authors Nikolai K. Vereshchagin

Publication date 1990

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01158085

zbMATH Keywords

decidability algorithmfirst-order theory of linearly ordered sets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Total orders (06A05)

Recommendations

• The decision problem for linear temporal logic
• scientific article; zbMATH DE number 4008363
• scientific article; zbMATH DE number 1163934

Cites work

• On the elementary theory of linear order
• The monadic theory of order

Cited in

(1)

• scientific article; zbMATH DE number 5582998 (Why is no real title available?)

This page was built for publication: New proof of the solvability of the elementary theory of linearly ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923067)