On non-tabular \(m\)-pre-complete classes of formulas in the propositional provability logic (Q3542154)
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 5375018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On non-tabular \(m\)-pre-complete classes of formulas in the propositional provability logic |
scientific article; zbMATH DE number 5375018 |
Statements
28 November 2008
0 references
functional expressibility
0 references
\(m\)-completeness
0 references
provability logic
0 references
0.8098878264427185
0 references
0.770799994468689
0 references
