The complexity of the modal predicate logic of “true in every transitive model of ZF” (Q4382481): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The degree of the set of sentences of predicate provability logic that are true under every interpretation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Provability interpretations of modal logic / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5807658 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the degrees of unsolvability of modal predicate logics of provability / rank | |||
Normal rank | |||
Latest revision as of 10:38, 28 May 2024
scientific article; zbMATH DE number 1130661
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the modal predicate logic of “true in every transitive model of ZF” |
scientific article; zbMATH DE number 1130661 |
Statements
The complexity of the modal predicate logic of “true in every transitive model of ZF” (English)
0 references
1 November 1998
0 references
modal predicate logic
0 references
provability logic
0 references
interpretation of modal formulas in set theory
0 references
transitive model of ZF
0 references
