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 QIDQ4809503

Andrei Gheorghe Rusu, Mefodie Raţă

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

provability logicfunctional completenessprecomplete classesGödel-Löb logicfunctional expressibility

Mathematics Subject Classification ID

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

Related Items (3)

A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic ⋮ Title not available (Why is that?) ⋮ On the closure properties of the class of full G-models of a deductive system

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)