Axiomatization and completeness of uncountably valued approximation logic
From MaRDI portal
Publication:1317906
DOI10.1007/BF01053027zbMath0787.03015OpenAlexW2030984848MaRDI QIDQ1317906
Publication date: 23 May 1994
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01053027
uncertaintyvaguenessplain semi-Post algebra\(LT\)-fuzzy logicsapproximate truth-valuesapproximation logicsuncountably valued logic
Fuzzy logic; logic of vagueness (03B52) Many-valued logic (03B50) Logical aspects of ?ukasiewicz and Post algebras (03G20)
Related Items
Rudiments of rough sets ⋮ Post Algebras in the Work of Helena Rasiowa ⋮ Rough Sets: From Rudiments to Challenges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Plain semi-Post algebras as a poset-based generalization of Post algebras and their representability
- Probabilistic logic
- \(LT\)-fuzzy sets
- An algebraic approach to non-classical logics
- L-fuzzy sets
- Rough sets
- Fuzzy sets
- The Lattice Theory of Post Algebras
- A proof of the completeness theorem of Grödel