On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic

DOI10.1515/DMA.2000.10.6.553MaRDI QIDQ4809503zbMATHOpenAlexFDO

Authors Mefodie Raţă, Andrei Rusu

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2000.10.6.553

zbMATH Keywords

functional completenessprovability logicprecomplete classesfunctional expressibilityGödel-Löb logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
• scientific article; zbMATH DE number 1148290
• scientific article; zbMATH DE number 6476595
• scientific article; zbMATH DE number 915329
• scientific article; zbMATH DE number 1215499

Cited in

(8)

• On absence of finite approximation relative to model completeness in the propositional provability logic
• A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
• On the closure properties of the class of full G-models of a deductive system
• Two notions of compactness in Gödel logics
• On the absence of finite approximation relative to model completeness in propositional provability logic
• scientific article; zbMATH DE number 7652671 (Why is no real title available?)
• Completeness criteria for expressibility in a 4-valued extension of provability logic
• Global neighbourhood completeness of the Gödel-Löb provability logic

This page was built for publication: On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic

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