The lattice of strengthenings of a strongly finite consequence operation

DOI10.1007/BF01874707zbMath0479.03017MaRDI QIDQ1161517

Wiesław Dziobiak

Publication date: 1981

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

structural strengthenings; algebraicness; finite approximability; strong finitisticity

Mathematics Subject Classification ID

03B99: General logic

Related Items

Equivalential logics. II, On structural completeness of implicational logics, Key notions of Tarski's methodology of deductive systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix representations for structural strengthenings of a propositional logic
• Reduced products of logical matrices
• The logics stronger than Lukasiewicz's three valued sentential calculus. The notion of degree of maximality versus the notion of degree of completeness
• A note on direct products and ultraproducts of logical matrices
• A representation theorem for the lattice of standard consequence operations
• Quasivarieties of algebraic systems
• Matrix approach in methodology of sentential calculi
• Connections between some notions of completeness of structural propositional calculi
• Degrees of maximality of Łukasiewicz-like sentential calculi
• A strongly finite logic with infinite degree of maximality
• On finitely based consequence operations
• Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
• On structural completeness of many-valued logics
• The Finite Model Property and Subsystems of Classical Propositional Calculus
• A Note on the Implicational Class Generated by a Class of Structures
• Some remarks on the consequence operation in sentential logics
• A theorem about infinite-valued sentential logic