Axiomatization and completeness of uncountably valued approximation logic
Studia Logica 53 (1):137 - 160 (1994)
Abstract
This article has no associated abstract. (fix it)DOI
10.1007/bf01053027
My notes
Similar books and articles
Plain semi-post algebras as a poset-based generalization of post algebras and their representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
Algorithmic logic. Multiple-valued extensions.Helena Rasiowa - 1979 - Studia Logica 38 (4):317 - 335.
Finite axiomatization for some intermediate logics.I. Janioka-Żuk - 1980 - Studia Logica 39 (4):415-423.
Topological representations of post algebras of order ω+ and open theories based on ω+-valued post logic.Helena Rasiowa - 1985 - Studia Logica 44 (4):353 - 368.
Analytics
Added to PP
2009-01-28
Downloads
28 (#418,627)
6 months
1 (#449,844)
2009-01-28
Downloads
28 (#418,627)
6 months
1 (#449,844)
Historical graph of downloads
References found in this work
Plain semi-post algebras as a poset-based generalization of post algebras and their representability.Nguyen Cat Ho & Helena Rasiowa - 1989 - Studia Logica 48 (4):509 - 530.
Subalgebras and homomorphisms of semi-post algebras.Nguyen Cat Ho & Helena Rasiowa - 1987 - Studia Logica 46 (2):161 - 175.
