The strong version of a sentential logic
type: Item
instance of: scholarly article
title: The strong version of a sentential logic
zbMATH Open document ID: 1417.03303
author: Hugo Albuquerque
author: Josep Maria Font
author: Ramon Jansana
published in: Studia Logica
publication date: 2017-11-16T00:00:00Z
Mathematics Subject Classification ID: 03G27
Mathematics Subject Classification ID: 03B47
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B50
zbMATH DE Number: 6807533
zbMATH Keywords: Leibniz operator
zbMATH Keywords: Suszko operator
zbMATH Keywords: protoalgebraic logic
zbMATH Keywords: truth-equational logic
zbMATH Keywords: strong version
zbMATH Keywords: non protoalgebraic logic
zbMATH Keywords: abstract algebraic logic
MaRDI profile type: Publication
full work available at URL: s11225-017-9709-0
OpenAlex ID: W2593401383
cites work: An infinity of super-Belnap logics
cites work: COMPATIBILITY OPERATORS IN ABSTRACT ALGEBRAIC LOGIC
cites work: Assertional logics, truth-equational logics, and the hierarchies of abstract algebraic logic
cites work: An algebraic view of super-Belnap logics
cites work: Q4297115
cites work: Q4083730
cites work: Q3206928
cites work: Algebraizable logics
cites work: Logics Preserving Degrees of Truth from Varieties of Residuated Lattices
cites work: A new semantics for positive modal logic
cites work: Priestley duality, a Sahlqvist theorem and a Goldblatt-Thomason theorem for positive modal logic
cites work: Bounded distributive lattices with strict implication
cites work: Note on algebraic models for relevance logic
cites work: Positive modal logic
cites work: Belnap's Four-Valued Logic and De Morgan Lattices
cites work: Q4450439
cites work: Q5411411
cites work: Taking degrees of truth seriously
cites work: On semilattice-based logics with an algebraizable assertional companion
cites work: Q3185647
cites work: On the infinite-valued Łukasiewicz logic that preserves degrees of truth
cites work: Leibniz filters and the strong version of a protoalgebraic logic
cites work: Q4715441
cites work: Leibniz-linked pairs of deductive systems
cites work: A survey of abstract algebraic logic
cites work: Algebraic study of two deductive systems of relevance logic
cites work: Residuated lattices. An algebraic glimpse at substructural logics
cites work: Q4530155
cites work: Leibniz filters revisited
cites work: Selfextensional logics with a conjunction
cites work: Algebraizable logics with a strong conjunction and their semi-lattice based companions
cites work: Structural Completeness in Substructural Logics
cites work: Nothing but the truth
cites work: Q5441554
cites work: Structural completeness in relevance logics
cites work: Q3791124
cites work: Theory of logical calculi. Basic theory of consequence operations
DOI: 10.1007/S11225-017-9709-0
Recommended article: Strong-separation logic
Recommended article: Predicate logics of expressively strong theories
Recommended article: Strong Logics of First and Second Order
Recommended article: Q4294469
Recommended article: Q5416154
Recommended article: Semi-intuitionistic logic with strong negation
Recommended article: A strong model of paraconsistent logic
Recommended article: Logics for approximate and strong entailments
Recommended article: Strong conceptual completeness for first-order logic
description: scientific article; zbMATH DE number 6807533