A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic

DOI10.1515/DMA-2002-0308zbMath1044.03044OpenAlexW2563995249MaRDI QIDQ4809578

M. F. Ratsa

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-2002-0308

zbMATH Keywords

provability logicGödel-Löb logicalgorithmic undecidabilityfunctional expressibilitygeneral expressibility problem

Mathematics Subject Classification ID

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

This page was built for publication: A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic