6533b834fe1ef96bd129d53e

RESEARCH PRODUCT

Regularly Algebraizable Logics

Janusz Czelakowski

subject

Discrete mathematicsAliasEquivalence (formal languages)Propositional calculusMathematics

description

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).

https://doi.org/10.1007/978-94-017-2807-2_8