Finite axiomatizability of locally tabular superintuitionistic logics (Q581390)
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 4019024
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite axiomatizability of locally tabular superintuitionistic logics |
scientific article; zbMATH DE number 4019024 |
Statements
Finite axiomatizability of locally tabular superintuitionistic logics (English)
0 references
1986
0 references
A superintuitionistic propositional logic L is called locally tabular if every finite set of propositional variables generates a finite number of L-nonequivalent propositional formulae. Using the algebraic approach, being mostly the only appropriate one in such cases, the author obtains the following interesting result: if L is a finitely axiomatizable locally tabular superintuitionistic propositional logic, then L is hereditarily finitey axiomatizable iff L has not more than a denumerable set of extensions.
0 references
finitely axiomatizable locally tabular superintuitionistic propositional logic
0 references
0.7972350120544434
0 references
0.7948534488677979
0 references
0.7933166027069092
0 references
0.7777847647666931
0 references
0.7766503095626831
0 references
