A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Reflection principles and provability algebras in formal arithmetic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kripke semantics for provability logic GLP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4397069 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On strong provability predicates and the associated modal logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Provability interpretations of modal logic / rank | |||
Normal rank |
Revision as of 19:41, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A simplified proof of arithmetical completeness theorem for provability logic GLP |
scientific article |
Statements
A simplified proof of arithmetical completeness theorem for provability logic GLP (English)
0 references
4 August 2014
0 references