A non-finitary sentential logic that is elementarily algebraizable

DOI10.1093/LOGCOM/EXN087MaRDI QIDQ3583103zbMATH OpenOpenAlexFDO

Authors J. G. Raftery

Publication date 26 August 2010

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exn087

zbMATH Keywords

consequence relationalgebraizabledeductive systemquasivarietyfinitary

Mathematics Subject Classification ID

Abstract deductive systems (03B22) Abstract algebraic logic (03G27)

Recommendations

• Equivalential and algebraizable logics
• scientific article; zbMATH DE number 945663
• Non-finite-axiomatizability results in algebraic logic
• scientific article; zbMATH DE number 67027
• Definitional equivalence and algebraizability of generalized logical systems

Cited in

(6)

• On prevarieties of logic
• scientific article; zbMATH DE number 945663 (Why is no real title available?)
• An example of a new kind of algebraizability
• Epimorphisms, definability and cardinalities
• Number of non-Fregean sentential logics that have adequate models
• Abstract algebraic logic. An introductory chapter

This page was built for publication: A non-finitary sentential logic that is elementarily algebraizable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583103)