Correspondence problems for classes of postlinear orders

DOI10.1007/S11787-025-00392-4MaRDI QIDQ6876527zbMATH OpenFDO

Authors Grigor Kolev, Tinko Tinchev

Publication date 13 January 2026

Published in Logica Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11787-025-00392-4

zbMATH Keywords

correspondence theoryintuitionistic Kripke framespostlinear orders

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Interpolation, preservation, definability (03C40)

Cites work

• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 4006233 (Why is no real title available?)
• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 4189692 (Why is no real title available?)
• The decision problem for branching time logic
• The monadic theory of order
• The truth about algorithmic problems in correspondence theory

This page was built for publication: Correspondence problems for classes of postlinear orders

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