Cited by 123Advanced Algebra and LogicLogic, Reasoning, and KnowledgeLogic, programming, and type systems

The DOI matches its Crossref record.

Gaggle theory: An abstraction of Galois connections and residuation, with applications to negation, implication, and various logical operators

Dunn, J. Michael·1991·Lecture Notes in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/bfb0018431

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Still being checked.

Research works printed but not linked: 17

  1. A. R. Anderson and N. D. Belnap et al (1975), Entailment: The Logic of Relevance and Necessity, vol. 1, Princeton (Princeton University Press).
  2. G. Birkhoff (1940, 1948, 1967), Lattice Theory, Providence (American Mathematical Society).
  3. T. S. Blyth and M. F. Janowitz (1972), Residuation Theory, New York (Pergamon Press Inc.).
  4. J. M. Dunn (1966), The Algebra of Intensional Logics. Doctoral Dissertation, University of Pittsburgh, Ann Arbor (University Microfilms). Portions relevant to this paper are reprinted in Anderson, Belnap, et al. as §8 and §28.2.
  5. C. J. Everett (1944), "Closure Operators and Galois Theory in Lattices," Transactions of the American Mathematical Society, 55, 514–525. · DOI
  6. L. Fuchs (1963), Partially-Ordered Algebraic Systems, New York (Pergamon Press Inc.).
  7. R. I. Goldblatt (1974), "Semantic Analysis of Orthologic," Journal of Philosophical Logic, 3, 19–35. · DOI
  8. B. Jónsson and A. Tarski (1951–52), "Boolean Algebras with Operators," American Journal of Mathematics, 73–74, 891–939, 127–162. · DOI
  9. J. Lambek (1981), "The Influence of Heraclitus on Modern Mathematics," in Scientific Philosophy Today, eds. J. Agassi and R. S. Cohen, Dordrecht (D. Reidel Publishing Company).
  10. E. J. Lemmon (1966), "Algebraic Semantics for Modal Logics, I and II," The Journal of Symbolic Logic, 32, 46–65, 191–218. · DOI
  11. S. MacLane (1971), Categories for the Working Mathematician, New York (Springer-Verlag).
  12. R. K. Meyer and R. Routley (1972), "Algebraic Analysis of Entailment," Logique et Analyse, n.s. 15, 407–428.
  13. O. Ore (1944), "Galois Connexions," Transactions of the American Mathematical Society, 55, 493–513. · DOI
  14. R. Routley and R. K. Meyer (1972–73), "The Semantics of Entailment I" in Truth, Syntax and Modality, ed. H. Leblanc, Amsterdam (North-Holland Publishing Company), pp. 199–243.
  15. M. Stone (1936), "The Theory of Representations for Boolean Algebras, Transactions of the American Mathematical Society, 40, 37–111.
  16. M. Stone (1937), "Topological Representations of Distributive Lattices and Brouwerian Logics," Casopsis pro Pestov ani Matematiky a Fysiky, 67, 1–25.
  17. M. Ward and R. P. Dilworth (1939), "Residuated Lattices," Transactions of the American Mathematical Society, 45, 335–54. · DOI

Cited by

Sorted by citations

See all 123

Metadata

Authors
Dunn, J. M.
Affiliations
Indiana University Bloomington (US)
Corresponding author
Dunn, J. Michael
Venue
Lecture Notes in Computer Science
Published
1991
Pages
31-51
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W1505344996
Cited by
123
References
0
Citations by year
2026: 1 · 2025: 3 · 2024: 2 · 2023: 1 · 2022: 10 · 2021: 8 · 2020: 2 · 2019: 3 · 2018: 6 · 2017: 3 · 2016: 11 · 2015: 2 · 2014: 3 · 2013: 1 · 2012: 1
FWCI
1.66
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Keywords
Galois connections, residuation, negation, implication, logical connectives, abstract algebraic logic, residuated lattices

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review