Solvability of theories of certain classes of elimination graphs

DOI10.1007/BF01069756zbMATH Open0558.05028MaRDI QIDQ3222869FDOQ3222869

Authors: D. Ja. Kesel'man 

Publication date: 1982

Published in: Cybernetics (Search for Journal in Brave)

Recommendations

• The structure of the models of decidable monadic theories of graphs
• Solvability of Graph Inequalities
• scientific article; zbMATH DE number 1533810
• The monadic second-order logic of graphs, II: Infinite graphs of bounded width
• Graphs and models with finite chains

zbMATH Keywords

chordal graphsinfinite graphselimination graphsQ-oriented graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Introduction to model theory and to the metamathematics of algebra
• Triangulated graphs and the elimination process
• Title not available (Why is that?)

Cited In (2)

• Solving a special case of the P conjecture using dependency graphs with dissolution
• Annotation theories over finite graphs

This page was built for publication: Solvability of theories of certain classes of elimination graphs

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