On the complexity of arithmetical interpretations of modal formulae

DOI10.1007/BF01375554zbMath0802.03011OpenAlexW2034796493MaRDI QIDQ688859

Lev D. Beklemishev

Publication date: 12 December 1994

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01375554

zbMATH Keywords

modal logicprovability logiccomplexity of formulasarithmetical interpretationsbounded arithmetical complexityprovability interpretation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Related Items

A course on bimodal provability logic

Cites Work

• Self-reference and modal logic
• Provability interpretations of modal logic
• Sentences implying their own provability
• The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems