Finite approximability of forest superintuitionistic logics

DOI10.1007/BF01139937MaRDI QIDQ1068076zbMATH OpenFDO

Authors Ya. M. Drugush

Publication date 1984

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

forestsintuitionistic logicKripke modelsfinite axiomatizability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55)

Recommendations

• On Composing Finite Forests with Modal Logics
• Modal logics with composition on finite forests: expressivity and complexity
• scientific article; zbMATH DE number 3639589
• scientific article; zbMATH DE number 3861126
• A result on the completeness of superintuitionistic logics
• scientific article; zbMATH DE number 4189701
• Finite axiomatizability of locally tabular superintuitionistic logics
• scientific article; zbMATH DE number 3871315
• LATIN 2004: Theoretical Informatics
• scientific article; zbMATH DE number 3906478

Cites work

• scientific article; zbMATH DE number 3131078 (Why is no real title available?)
• scientific article; zbMATH DE number 3300568 (Why is no real title available?)
• A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property

Cited in

(2)

• scientific article; zbMATH DE number 3861126 (Why is no real title available?)
• Union of logics modeled by finite trees

This page was built for publication: Finite approximability of forest superintuitionistic logics

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