Axiomatization and completeness of uncountably valued approximation logic
type: Item
instance of: scholarly article
title: Axiomatization and completeness of uncountably valued approximation logic
zbMATH Open document ID: 0787.03015
DOI: 10.1007/BF01053027
author: Helena Rasiowa
published in: Studia Logica
publication date: 1994-05-23T00:00:00Z
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03B52
Mathematics Subject Classification ID: 03G20
zbMATH DE Number: 536896
zbMATH Keywords: vagueness
zbMATH Keywords: uncountably valued logic
zbMATH Keywords: uncertainty
zbMATH Keywords: approximation logics
zbMATH Keywords: \(LT\)-fuzzy logics
zbMATH Keywords: approximate truth-values
zbMATH Keywords: plain semi-Post algebra
MaRDI profile type: Publication
cites work: Q3257121
cites work: Plain semi-Post algebras as a poset-based generalization of Post algebras and their representability
cites work: Q3867808
cites work: The Lattice Theory of Post Algebras
cites work: Q3789107
cites work: L-fuzzy sets
cites work: Probabilistic logic
cites work: Rough sets
cites work: Q4003537
cites work: An algebraic approach to non-classical logics
cites work: Q3976584
cites work: \(LT\)-fuzzy sets
cites work: A proof of the completeness theorem of Grödel
cites work: Q5734410
cites work: Q5661846
cites work: Q4024050
cites work: Fuzzy sets
full work available at URL: https://doi.org/10.1007/bf01053027
OpenAlex ID: W2030984848
description: scientific article; zbMATH DE number 536896