Completeness proof by semantic diagrams for transitive closure of accessibility relation (Q2904055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6063265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Completeness proof by semantic diagrams for transitive closure of accessibility relation |
scientific article; zbMATH DE number 6063265 |
Statements
5 August 2012
0 references
modal logic
0 references
accessibility relation
0 references
transitive closure
0 references
completeness with respect to finite models
0 references
semantic diagram
0 references
0.8661314
0 references
0.85523605
0 references
0.8527235
0 references
0.8389511
0 references
0.83828163
0 references
0.83552104
0 references
0.8354938
0 references
0.83396226
0 references
Completeness proof by semantic diagrams for transitive closure of accessibility relation (English)
0 references
