scientific article; zbMATH DE number 1148290

zbMATH Open0910.03014MaRDI QIDQ4386747FDOQ4386747

Authors: Andrei Rusu 

Publication date: 19 April 1999

Title of this publication is not available (Why is that?)

Recommendations

• On absence of finite approximation relative to model completeness in the propositional provability logic
• On the absence of finite approximation relative to model completeness in propositional provability logic
• On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic
• scientific article; zbMATH DE number 6476595
• Completeness criteria for expressibility in a 4-valued extension of provability logic

zbMATH Keywords

provability logiclocally tabularfinitely approximable with respect to completenessformula basis

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Cited In (6)

• On absence of finite approximation relative to model completeness in the propositional provability logic
• On the absence of finite approximation relative to model completeness in propositional provability logic
• On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completeness criteria for expressibility in a 4-valued extension of provability logic

This page was built for publication:

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