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

DOI10.1007/BF01158085zbMATH Open0712.03005OpenAlexW2075243440MaRDI QIDQ923067FDOQ923067

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

Recommendations

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

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)

Cites Work

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

Cited In (1)

• Title not available (Why is that?)

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)