A simplified proof of arithmetical completeness theorem for provability logic GLP (Q2510758): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s0081543811060046 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1574162351 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 30 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
