A logic of implications in algebra and coalgebra
DOI10.1007/S00012-009-0009-ZzbMATH Open1229.18001OpenAlexW2029610160MaRDI QIDQ1047097FDOQ1047097
Authors: Jiří Adámek, Manuela Sobral, Lurdes Sousa
Publication date: 4 January 2010
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/11299
Recommendations
- Categorical Abstract Algebraic Logic: Categorical Algebraization of Equational Logic
- Categorical abstract algebraic logic: categorical algebraization of first-order logic without terms
- Abstract logics as dialgebras
- Categorical Abstract Algebraic Logic: Structurality, protoalgebraicity, and correspondence
- Categorical abstract algebraic logic: Partially ordered algebraic systems
algebrascoalgebraslogic of injectivityBirkhoff calculuscoalgebraic implicationsGumm calculuslogic of implications
Logic in computer science (03B70) Equational classes, universal algebra in model theory (03C05) Foundations, relations to logic and deductive systems (18A15)
Cites Work
- Universal coalgebra: A theory of systems
- On tree coalgebras and coalgebra presentations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the final sequence of a finitary set functor
- Title not available (Why is that?)
- Completeness Theorems for Universal and Implicational Logics of Algebras Via Congruences
- A logic of orthogonality.
- Title not available (Why is that?)
- Computer Science Logic
- On varieties and covarieties in a category
- Title not available (Why is that?)
- Birkhoffs variety theorem for coalgebras
- The intersection of algebra and coalgebra
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- The temporal logic of coalgebras via Galois algebras
- Residually small varieties without rank
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equational and implicational classes of coalgebras
- Solid hulls of concrete categories
- Modal operators and the formal dual of Birkhoffs completeness theorem This research is part of the Logic of Types and Computation project at Carnegie Mellon University under the direction of Dana Scott.
- Parametrized data types do not need highly constrained parameters
- Complete Categorical Deduction for Satisfaction as Injectivity
Cited In (6)
This page was built for publication: A logic of implications in algebra and coalgebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1047097)