Synthetic completeness proofs for Seligman-style tableau systems (Q4636041)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synthetic completeness proofs for Seligman-style tableau systems |
scientific article; zbMATH DE number 6863651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Synthetic completeness proofs for Seligman-style tableau systems |
scientific article; zbMATH DE number 6863651 |
Statements
23 April 2018
0 references
hybrid logic
0 references
tableaus
0 references
Seligman-style
0 references
synthetic completeness method
0 references
Bridge rule
0 references
pure axioms
0 references
tense logic
0 references
universal modality
0 references
difference operator
0 references
0.867510974407196
0 references
0.842854380607605
0 references
0.7836220860481262
0 references
0.782203197479248
0 references
