The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Continuing the study of different types of Abstract Logics [5], and following works by Brown-Bloom [1] and Brown-Suszko [2], we analyze in this paper some logics in which, if we identify equivalent formulae by means of the consequence operator, we obtain distributive lattices or Boolean algebras.
Currently displaying 1 –
5 of
5