Uniform arithmetical completeness of modal provability logics

DOI10.1007/BF01164256zbMath0726.03041OpenAlexW2055773991MaRDI QIDQ2277453

S. N. Artëv

Publication date: 1990

Published in: Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

diagonalizationmodal logicsintuitionistic logicsextremely undecidable sentencesuniform arithmetical completeness of propositional logics of provability

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)

Cites Work

• Unnamed Item
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Provability interpretations of modal logic
• Extremely undecidable sentences

This page was built for publication: Uniform arithmetical completeness of modal provability logics