pith. sign in

arxiv: 2607.01271 · v1 · pith:FDG6W6LBnew · submitted 2026-06-30 · 🧮 math.LO · cs.LO

On Strong Structural Completeness of Varieties and Quasivarieties

Alex Citkin (Metropolitan Telecommunications , NewYork USA) This is my paper

Pith reviewed 2026-07-03 22:01 UTC · model grok-4.3

classification 🧮 math.LO cs.LO
keywords strong structural completenessquasivarietyvarietycongruence extension propertytabular varietycongruence meet-semidistributiveprimitive varietyDummett logic
0
0 comments X

The pith

Quasivarieties of finite type with the CEP and an infinite irreducible algebra are never strongly structurally complete.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that any quasivariety of finite type generated by finite algebras that has the congruence extension property and contains an infinite irreducible algebra cannot be strongly structurally complete. It further shows that congruence meet-semidistributive varieties of finite type generated by finite algebras are strongly structurally complete exactly when they are tabular. The results imply that certain well-known logics are structurally complete but not strongly so. In primitive congruence-distributive varieties, strong primitivity holds precisely for the tabular subvarieties.

Core claim

Every quasivariety of finite type with the CEP that is generated by finite algebras and contains an infinite irreducible algebra is not SSCpl. Every congruence meet-semidistributive variety of finite type generated by finite algebras is SSCpl if and only if it is tabular. In primitive congruence-distributive varieties of finite type, the tabular subvarieties, and only those, are strongly primitive.

What carries the argument

Strong structural completeness, the property that a quasivariety or variety is generated as a prevariety by its free algebras.

If this is right

  • Dummett's logic is structurally complete but not strongly structurally complete.
  • Medvedev's logic is structurally complete but not strongly structurally complete.
  • Only the tabular subvarieties of primitive congruence-distributive varieties of finite type are strongly primitive.
  • The tabular condition supplies a criterion for strong primitivity in such varieties.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Logics whose varieties contain infinite irreducible algebras may need extra restrictions to reach strong structural completeness.
  • The tabular property may link to having only finitely many finite models up to isomorphism.
  • Similar characterizations could apply to other completeness notions in varieties with congruence distributivity.

Load-bearing premise

The quasivarieties and varieties are of finite type and generated by finite algebras.

What would settle it

Exhibit a quasivariety of finite type with the CEP, generated by finite algebras, that contains an infinite irreducible algebra yet is generated as a prevariety by its free algebras.

Figures

Figures reproduced from arXiv: 2607.01271 by Alex Citkin (Metropolitan Telecommunications, NewYork USA).

Figure 1
Figure 1. Figure 1: Chain Heyting algebras. On the other hand, Cω+2 cannot be embedded into Cω+1, and by Proposition 2.5, it follows that Cω+1 |= c. Thus, for every κ > ω, Cω+2 ∈/ Qκ (Cω+1). (1) Remark 1. In Example 1, we simplified the κ-characteristic quasiequation by omitting from the an￾tecedent some equations that are consequences of the remaining ones. For example, if xaj → xai = xai , then xai ≤ xaj and therefore xai ∧… view at source ↗
read the original abstract

We study structural completeness in the infinitary sense (strong structural completeness) in an algebraic setting. A variety is structurally complete (SCpl) if it is generated, as a quasivariety, by its free algebras, and it is strongly structurally complete (SSCpl) if it is generated, as a prevariety, by its free algebras. A quasivariety is SSCpl if it is generated, as a prevariety, by its free algebras. We prove that every quasivariety of finite type with the CEP that is generated by finite algebras and contains an infinite irreducible algebra is not SSCpl. Moreover, every congruence meet-semidistributive variety of finite type generated by finite algebras is SSCpl if and only if it is tabular. Thus, Dummett's and Medvedev's logics are SCpl but not SSCpl. A variety is primitive if it is SCpl and all its subvarieties are SCpl; it is strongly primitive if it is SSCpl and all its subvarieties are SSCpl. We prove that in primitive congruence-distributive varieties of finite type, the tabular subvarieties, and only those, are strongly primitive. This observation also yields a criterion for strong primitivity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper studies strong structural completeness (SSCpl) for varieties and quasivarieties. It proves that every quasivariety of finite type with the congruence extension property (CEP), generated by finite algebras and containing an infinite irreducible algebra, fails to be SSCpl. It further shows that every congruence meet-semidistributive variety of finite type generated by finite algebras is SSCpl if and only if it is tabular, implying that Dummett's and Medvedev's logics are SCpl but not SSCpl. Finally, in primitive congruence-distributive varieties of finite type, the tabular subvarieties are precisely the strongly primitive ones, yielding a criterion for strong primitivity.

Significance. If the results hold, they supply clean characterizations linking SSCpl to tabularity under finite type, CEP, and generation-by-finite-algebras hypotheses, while distinguishing SCpl from SSCpl and primitive from strongly primitive varieties. The concrete application to Dummett's and Medvedev's logics illustrates the distinction in a well-studied setting. The work strengthens the algebraic theory of structural completeness by isolating the role of infinite irreducibles and congruence conditions.

minor comments (3)
  1. The abstract introduces 'CEP' without immediate expansion; spell out 'congruence extension property' on first use for readers outside the immediate subfield.
  2. The claim that Dummett's and Medvedev's logics fit the hypotheses (finite type, CEP, generated by finite algebras, infinite irreducible) would benefit from a one-sentence justification or citation to the relevant algebraization in the introduction.
  3. Notation for 'SSCpl' and 'SCpl' is introduced clearly in the abstract but should be repeated with a short reminder in the first paragraph of the main text.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of the paper's significance and the recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper states theorems on strong structural completeness for quasivarieties and varieties under explicit hypotheses (finite type, CEP, generation by finite algebras, presence of infinite irreducible algebra, congruence meet-semidistributivity). These are standard structural assumptions in universal algebra that enable the generation arguments; the abstract and described results contain no equations, fitted parameters, or self-citations that reduce the claimed equivalences or non-SSCpl statements back to the inputs by construction. The derivation chain is self-contained against external benchmarks in the field.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Only abstract available; no fitted numerical parameters or invented entities are mentioned. The work rests on standard axioms of universal algebra and the definitions of SCpl/SSCpl given in the text.

axioms (2)
  • standard math Standard axioms of lattice theory and congruence lattices in universal algebra
    Invoked implicitly when discussing CEP, meet-semidistributivity, and generation by free algebras.
  • domain assumption Finite type and generation by finite algebras
    Stated as hypothesis for all main theorems in the abstract.

pith-pipeline@v0.9.1-grok · 5757 in / 1483 out tokens · 31802 ms · 2026-07-03T22:01:36.622082+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

27 extracted references · 18 canonical work pages

  1. [1]

    W. J. Blok & B. Jonsson (1999): Algebraic structures for logic. A course given at the 23rd Holiday Mathe- matics Symposium, New Mexico State University. 276 On Strong Structural Completeness

    1999

  2. [2]

    W. J. Blok & D. Pigozzi (1982): On the structure of varieties with equationally definable principal congru- ences. I. Algebra Universalis 15(2), pp. 195–227, doi:10.1007/BF02483723

    work page doi:10.1007/bf02483723 1982

  3. [3]

    W. J. Blok & Don Pigozzi (1989): Algebraizable logics. Mem. Amer. Math. Soc. 77(396), pp. vi+78, doi:10.1090/memo/0396

    work page doi:10.1090/memo/0396 1989

  4. [4]

    Burris & H

    S. Burris & H. P. Sankappanavar (1981): A course in universal algebra. Graduate Texts in Mathematics 78, Springer-Verlag, New York, doi:10.1007/978-1-4613-8130-3

    work page doi:10.1007/978-1-4613-8130-3 1981

  5. [5]

    Giunti and C

    A. Chagrov & M. Zakharyaschev (1997): Modal logic. Oxford Logic Guides 35, The Clarendon Press Oxford University Press, New York, doi:10.1093/oso/9780198537793.001.0001. Oxford Science Publications

    work page doi:10.1093/oso/9780198537793.001.0001 1997

  6. [6]

    A. I. Citkin (1978): Structurally complete superintuitionistic logics . Dokl. Akad. Nauk SSSR 241(1), pp. 40–43

    1978

  7. [7]

    Czelakowski & W

    J. Czelakowski & W. Dziobiak (1990): Congruence distributive quasivarieties whose finitely subdirectly irre- ducible members form a universal class. Algebra Universalis 27(1), pp. 128–149, doi:10.1007/BF01190258

    work page doi:10.1007/bf01190258 1990

  8. [8]

    Dzik & P

    W. Dzik & P. Wojtylak (2015): Almost structurally complete infinitary consequence operations extending S4.3. Log. J. IGPL 23(4), pp. 640–661, doi:10.1093/jigpal/jzv024

    work page doi:10.1093/jigpal/jzv024 2015

  9. [9]

    Dzik & A

    W. Dzik & A. Wro ´nski (1973): Structural completeness of Gödel’s and Dummett’s propositional calculi . Studia Logica 32, pp. 69–75, doi:10.1007/BF02123815

    work page doi:10.1007/bf02123815 1973

  10. [10]

    R. S. Freese, R. N. McKenzie, G. F. McNulty & W. F. Taylor (2022): Algebras, lattices, varieties. Vol. II . Mathematical Surveys and Monographs 268, American Mathematical Society, Providence, RI, doi:10.1090/surv/268

    work page doi:10.1090/surv/268 2022

  11. [11]

    V . A. Gorbunov (1998): Algebraic theory of quasivarieties. Siberian School of Algebra and Logic, Consul- tants Bureau, New York, doi:10.1007/978-1-4615-5347-2. Translated from the Russian

    work page doi:10.1007/978-1-4615-5347-2 1998

  12. [12]

    Grätzer (2008): Universal algebra, second edition

    G. Grätzer (2008): Universal algebra, second edition. Springer, New York, doi:10.1007/978-0-387-77487-9. With appendices by Grätzer, Bjarni Jónsson, Walter Taylor, Robert W. Quackenbush, Günter H. Wenzel, and Grätzer and W. A. Lampe

    work page doi:10.1007/978-0-387-77487-9 2008

  13. [13]

    K. A. Kearnes & R. Willard (1999): Residually finite, congruence meet-semidistributive varieties of finite type have a finite residual bound . Proc. Amer. Math. Soc. 127(10), pp. 2841–2850, doi:10.1090/S0002- 9939-99-05097-2

    work page doi:10.1090/s0002- 1999

  14. [14]

    Köhler (1981): Brouwerian semilattices

    P. Köhler (1981): Brouwerian semilattices . Trans. Amer. Math. Soc. 268(1), pp. 103–126, doi:10.2307/1998339

    work page doi:10.2307/1998339 1981

  15. [15]

    Lávi ˇcka & C

    T. Lávi ˇcka & C. Noguera (2017): A new hierarchy of infinitary logics in abstract algebraic logic . Studia Logica 105(3), pp. 521–551, doi:10.1007/s11225-016-9699-3

    work page doi:10.1007/s11225-016-9699-3 2017

  16. [16]

    Ło ´s & R

    J. Ło ´s & R. Suszko (1958): Remarks on sentential logics. Nederl. Akad. Wetensch. Proc. Ser. A 61 = Indag. Math. 20, pp. 177–183, doi:10.2307/2271813

    work page doi:10.2307/2271813 1958

  17. [17]

    Moraschini (2018): A logical and algebraic characterization of adjunctions between generalized quasi- varieties

    T. Moraschini (2018): A logical and algebraic characterization of adjunctions between generalized quasi- varieties. J. Symb. Log. 83(3), pp. 899–919, doi:10.1017/jsl.2018.47

    work page doi:10.1017/jsl.2018.47 2018

  18. [18]

    W. A. Pogorzelski (1971): Structural completeness of the propositional calculus. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 19, pp. 349–351

    1971

  19. [19]

    Prucnal (1976): Structural completeness of Medvedev’s propositional calculus

    T. Prucnal (1976): Structural completeness of Medvedev’s propositional calculus. Rep. Math. Logic (6), pp. 103–105

    1976

  20. [20]

    Prucnal (1979): On two problems of Harvey Friedman

    T. Prucnal (1979): On two problems of Harvey Friedman . Studia Logica 38(3), pp. 247–262, doi:10.1007/BF00405383

    work page doi:10.1007/bf00405383 1979

  21. [21]

    Prucnal (1983): Structural completeness of some fragments of intermediate logics

    T. Prucnal (1983): Structural completeness of some fragments of intermediate logics. Bull. Sect. Logic, Pol. Acad. Sci. 12, pp. 41–44

    1983

  22. [22]

    Prucnal (1985): Structural completeness of purely implicational intermediate logics

    T. Prucnal (1985): Structural completeness of purely implicational intermediate logics . In: Foundations of logic and linguistics (Salzburg, 1983) , Plenum, New York, pp. 31–41. Alex Citkin 277

    1985

  23. [23]

    Rautenberg (1985): A note on implicational intermediate consequences

    W. Rautenberg (1985): A note on implicational intermediate consequences . Polish Acad. Sci. Inst. Philos. Sociol. Bull. Sect. Logic 14(3), pp. 103–108

    1985

  24. [24]

    V . V . Rybakov (1997): Admissibility of logical inference rules . Studies in Logic and the Foundations of Mathematics 136, North-Holland Publishing Co., Amsterdam

    1997

  25. [25]

    Shafaat (1969): On implicationally defined classes of algebras

    A. Shafaat (1969): On implicationally defined classes of algebras . J. London Math. Soc. 44, pp. 137–140, doi:10.1112/jlms/s1-44.1.137

    work page doi:10.1112/jlms/s1-44.1.137 1969

  26. [26]

    Wojtylak (1990): A syntactical characterization of structural completeness for implicational logics

    P. Wojtylak (1990): A syntactical characterization of structural completeness for implicational logics. Polish Acad. Sci. Inst. Philos. Sociol. Bull. Sect. Logic 19(1), pp. 2–9

    1990

  27. [27]

    Wojtylak (1991): On structural completeness of implicational logics

    P. Wojtylak (1991): On structural completeness of implicational logics . Studia Logica 50(2), pp. 275–297, doi:10.1007/BF00370188

    work page doi:10.1007/bf00370188 1991