Categorical Abstract Algebraic Logic: Bloom's Theorem for Rule-Based -Institutions

DOI10.1093/jigpal/jzn002zbMath1142.03037OpenAlexW2137092920MaRDI QIDQ3508161

George Voutsadakis

Publication date: 27 June 2008

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/e3add4b9e4eb8367527f796cd74734077ad5f987

zbMATH Keywords

closure operatorslogical matricesultraproductsdeductive systemsrules of inferencefiltered products\(\pi\)-institutionsBloom's theoremuniversal Horn logic without equality

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Abstract model theory (03C95)

Related Items

Categorical abstract algebraic logic: prealgebraicity and protoalgebraicity, Categorical Abstract Algebraic Logic: Algebraic Semantics for (\documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf{\pi }$\end{document})‐Institutions, Categorical Abstract Algebraic Logic: Structurality, protoalgebraicity, and correspondence