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

DOI10.1515/DMA.2000.10.6.553zbMATH Open1044.03045OpenAlexW2081558918MaRDI QIDQ4809503FDOQ4809503

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

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
• scientific article; zbMATH DE number 915329
• scientific article; zbMATH DE number 1215499

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)

Cited In (8)

• Two notions of compactness in Gödel logics
• Title not available (Why is that?)
• A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
• 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
• Global neighbourhood completeness of the Gödel-Löb provability logic
• On the closure properties of the class of full G-models of a deductive system
• Completeness criteria for expressibility in a 4-valued extension of 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)