6533b834fe1ef96bd129d53e
RESEARCH PRODUCT
Regularly Algebraizable Logics
Janusz Czelakowskisubject
Discrete mathematicsAliasEquivalence (formal languages)Propositional calculusMathematicsdescription
A sentential logic (S, C) is regularly algebraizable (alias 1-algebraizable) if it possesses a non-empty system E(p, q) of equivalence sentences such that E(p, q) ⊆ C(p, q).
year | journal | country | edition | language |
---|---|---|---|---|
2001-01-01 |