Provability in predicate product logic
type: Item
instance of: scholarly article
title: Provability in predicate product logic
zbMATH Open document ID: 1121.03035
author: Shirin Malekpour
author: M. C. Laskowski
published in: Archive for Mathematical Logic
publication date: 2007-06-07T00:00:00Z
review text: The paper extends the theory of BL-logics introduced by \textit{P. Hájek} in 1998, exploiting the connection of the cancellative conjunctions on BL-algebras with ordered abelian groups. Then a sentence is provable if and only if it is a tautology (completeness). Moreover, closed models and the lexicographic sums are discussed and the completeness of BL-chains which are initially dense (or which are not initially dense) is studied.
reviewed by: Radko Mesiar
Mathematics Subject Classification ID: 03B52
zbMATH DE Number: 5162353
zbMATH Keywords: BL-logic
zbMATH Keywords: predicate product logic
zbMATH Keywords: provability
MaRDI profile type: Publication
full work available at URL: s00153-007-0036-4
OpenAlex ID: W1993301779
cites work: Note on Hahn's Theorem on Ordered Abelian Groups
cites work: Metamathematics of fuzzy logic
cites work: Making fuzzy description logic more general
cites work: A classification of BL-algebras
cites work: Generalized ordinal sums and the decidability of BL-chains
cites work: Three complexity problems in quantified fuzzy logic
DOI: 10.1007/S00153-007-0036-4
Recommended article: The predicate modal logic of provability
Recommended article: Q3809769
Recommended article: Predicate provability logic with non-modalized quantifiers
Recommended article: Q3708775
Recommended article: Q4376078
Recommended article: Provability logic and the completeness principle
Recommended article: Provability multilattice logic
Recommended article: Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
Recommended article: Provability logics with quantifiers on proofs
Recommended article: Q5307881
description: scientific article; zbMATH DE number 5162353