arxiv: 2603.19177 · v2 · submitted 2026-03-19 · 🪐 quant-ph

Recognition: 3 theorem links

· Lean Theorem

Quantum Structures as Generative Scores: Partition Logic, Generative Logic, and Aesthetic Form

Christian Jendreiko , Karl Svozil

Authors on Pith no claims yet

Pith reviewed 2026-05-15 08:03 UTC · model grok-4.3

classification 🪐 quant-ph

keywords partition logicgenerative grammarPrologquantum squarecomplementarityV-logicaesthetic form

0 comments

The pith

Finite partition logics translate into Prolog grammars that generate visual forms preserving complementarity.

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

The paper shows how to convert finite partition logics into Prolog-based generative grammars. Using the five-atom V-logic L12 as an example, the translation produces the Quantum Square, a modular visual artifact. This keeps the logical structure separate from its visual realization, turning abstract partitions into a resource for design and for showing complementarity. A reader would care because the method offers a concrete way to turn logical relations into usable outputs without collapsing the underlying logic.

Core claim

Translating the five-atom V-logic L12 into a Simple Generative Logic Grammar in Prolog generates the Quantum Square as a modular visual artifact. The translation treats partition logic as a generative score that drives the form while keeping logical structure distinct from any specific realization in visual, textual, or sonic media.

What carries the argument

The Prolog-based Simple Generative Logic Grammar obtained by direct translation from a finite partition logic, which maps partition relations to production rules that output modular elements while retaining complementarity.

If this is right

Partition logics can serve directly as input for generative design systems.
The same logical structure can drive outputs in different media without rewriting the logic.
Complementarity becomes expressible through concrete artifacts that viewers can inspect.
Finite partition logics become systematic sources of modular forms rather than purely abstract objects.

Where Pith is reading between the lines

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

The method could extend to other small partition logics to produce families of related artifacts.
Human perception tests on the generated forms could check whether they communicate the intended logical relations.
Similar grammar translations might apply to sonic or textual generative works based on the same logics.

Load-bearing premise

The logical relations in the original partition logic survive translation into a Prolog grammar without loss of structure or meaning.

What would settle it

Generating the Quantum Square from L12 and then checking whether its modular relations fail to match the complementarity and partition properties of the source logic would disprove the translation claim.

Figures

Figures reproduced from arXiv: 2603.19177 by Christian Jendreiko, Karl Svozil.

**Figure 2.** Figure 2: FIG. 2. Triangle-logic generalization of the [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗

read the original abstract

We connect partition logic with Generative Logic by translating finite partition logics into Prolog-based Simple Generative Logic Grammars. As a proof of concept, we use the five-atom V-logic L_{12} to generate a modular visual artifact, the \emph{Quantum Square}. The approach separates logical structure from its visual, textual, or sonic realization. This makes partition logic useful both as a generative design resource and as a tool for communicating complementarity.

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.

Desk Editor's Note private letter to a colleague

The paper gives a concrete translation of partition logic into Prolog grammars for generating artifacts like the Quantum Square, but skips the checks needed to confirm the logic actually controls the outputs.

read the letter

The paper connects partition logic to generative systems by translating finite partition logics into Prolog-based grammars, with a proof-of-concept using the five-atom V-logic L12 to produce a modular visual artifact called the Quantum Square. This approach keeps the logical structure separate from its realization in visuals or other media, which is a practical step for using these logics in design and for teaching ideas like complementarity. What is new is the specific mapping to Simple Generative Logic Grammars. It gives a working example that turns abstract partition relations into rules that generate artifacts, rather than stopping at the logic itself. The paper does well in presenting this as a resource for both creation and communication. The example is simple and modular, making it easy to see how the logic could drive outputs without tying it to physics. The soft spot is the verification of structure preservation. As the stress-test points out, there is no explicit check or enumeration showing that the generated forms respect the original partition atoms and relations, or that invalid ones are prevented by the grammar. Without that, the claim that the artifacts are logic-driven rests on description rather than demonstration. The lack of equations or detailed steps also makes it hard to assess how solid the translation is. This paper is for people interested in applying quantum logic ideas to generative design, visualization, or education. It could give them a starting point for experiments. I would cite it if I were working on similar logic-to-grammar translations, but only after seeing the full details. It deserves peer review because the framing is original and the example is there, though it will need added checks to hold up.

Referee Report

2 major / 1 minor

Summary. The paper claims to connect partition logic with generative logic by translating finite partition logics into Prolog-based Simple Generative Logic Grammars. As a proof of concept, the five-atom V-logic L_{12} is translated to generate a modular visual artifact called the Quantum Square, with the approach separating logical structure from visual/textual/sonic realization to support generative design and communication of complementarity.

Significance. If the translation preserves the underlying partition relations and complementarity, the work could provide a concrete bridge between logical structures and generative systems, offering a resource for design applications and a novel way to communicate quantum-inspired concepts. The proof-of-concept nature and separation of structure from realization are potentially useful strengths, but verification details are needed to establish utility.

major comments (2)

[Translation from L_{12} to Prolog grammar] Section on translation of L_{12} to Simple Generative Logic Grammar: No formal mapping, axiom check, or enumeration is provided showing that the Prolog rules encode the five partition atoms and complementarity relations of L_{12} such that all generated forms (e.g., the Quantum Square) satisfy the original constraints while excluding invalid partitions. This leaves open whether the output is logic-driven or arbitrary.
[Proof-of-concept with Quantum Square] Proof-of-concept section describing the Quantum Square: The separation of logical structure from realization is asserted but not demonstrated via explicit verification steps or output enumeration confirming preservation of partition relations in the generated artifact.

minor comments (1)

[Abstract] The abstract states the translation and proof-of-concept but omits any equations, derivation steps, or verification details, reducing accessibility for readers expecting technical grounding.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed and constructive report. The comments correctly identify areas where the current presentation of the L_{12} translation and the Quantum Square proof-of-concept would benefit from additional explicit verification. We address each point below and will incorporate the requested clarifications in a revised manuscript.

read point-by-point responses

Referee: [Translation from L_{12} to Prolog grammar] Section on translation of L_{12} to Simple Generative Logic Grammar: No formal mapping, axiom check, or enumeration is provided showing that the Prolog rules encode the five partition atoms and complementarity relations of L_{12} such that all generated forms (e.g., the Quantum Square) satisfy the original constraints while excluding invalid partitions. This leaves open whether the output is logic-driven or arbitrary.

Authors: We agree that an explicit formal mapping strengthens the claim. The Prolog grammar was constructed by encoding each of the five atoms of L_{12} as a distinct non-terminal whose production rules directly mirror the partition blocks and the complementarity relation (no two atoms share a block). In the revision we will insert a new subsection that (i) lists the five atoms and their block memberships, (ii) shows the corresponding Prolog clauses, (iii) provides a short axiom-check predicate that verifies every generated string respects the original partition lattice, and (iv) enumerates the first ten outputs together with the atom sequence that produced them, confirming that invalid partitions are excluded by construction. revision: yes
Referee: [Proof-of-concept with Quantum Square] Proof-of-concept section describing the Quantum Square: The separation of logical structure from realization is asserted but not demonstrated via explicit verification steps or output enumeration confirming preservation of partition relations in the generated artifact.

Authors: The separation is realized by keeping the generative grammar free of any rendering predicates; visual, textual or sonic realizations are attached only after generation via separate modules. To make this explicit, the revised manuscript will add a verification paragraph that traces one complete derivation of the Quantum Square back to the five L_{12} atoms, lists the partition constraints satisfied at each step, and shows that the final artifact contains no combination forbidden by the original logic. A small table of generated variants will further illustrate that all outputs remain within the valid partition set. revision: yes

Circularity Check

0 steps flagged

No circularity: methodological translation presented without self-referential derivation or fitted predictions

full rationale

The paper describes a translation of finite partition logics (such as the five-atom V-logic L_{12}) into Prolog-based Simple Generative Logic Grammars to generate artifacts like the Quantum Square. This is framed as a proof-of-concept connection that separates logical structure from realization. No equations, parameters, or predictions are defined in terms of themselves; the central claim is a feasible mapping for generative design rather than a quantity derived from fitted inputs or self-citation chains. The approach relies on explicit construction of grammars from partition atoms, with no reduction of outputs to inputs by definition. This is a standard non-circular methodological contribution.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no identifiable free parameters, axioms, or invented entities; the claim rests on the feasibility of the translation process which is not detailed.

pith-pipeline@v0.9.0 · 5364 in / 1129 out tokens · 31867 ms · 2026-05-15T08:03:05.428439+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/ArithmeticFromLogic.lean LogicNat recovery; embed_injective unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We connect partition logic with Generative Logic by translating finite partition logics into Prolog-based Simple Generative Logic Grammars... the grammar GL constructed from Eqs.(17)–(19) preserves the incidence relation between atoms and two-valued states.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel; Jcost unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

V-logic L12... supports T(a)={s1,s2},... q→a b c d e; a→s1 s2 br s3 s4 s5 n
IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking; SphereAdmitsCircleLinking D ↔ D=3 unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Greechie-style hypergraph... two three-atomic contexts C1={a,b,c}, C2={c,d,e}

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages · 3 internal anchors

[1]

aformal skeleton, given by a partition logic or related finite event structure; ∗ christian.jendreiko@hs-duesseldorf.de † karl.svozil@tuwien.ac.at

work page
[2]

agenerative grammar, which translates that skeleton into a structured template of positions

work page
[3]

Quantum Structures as Generative Scores: Partition Logic, Generative Logic, and Aesthetic Form

asign repertoire and rendering rule, which realizes that structure in a concrete medium. This separation is important both artistically and scientifically. Artistically, it allows the same structure to migrate across me- dia. Scientifically, it prevents us from conflating a combina- torial structure with a particular physical realization or proba- bility ...

work page internal anchor Pith review Pith/arXiv arXiv doi:10.55776/pin5424624 2026
[4]

Svozil,Randomness & Undecidability in Physics(World Scientific, Singapore, 1993)

K. Svozil,Randomness & Undecidability in Physics(World Scientific, Singapore, 1993)

work page 1993
[5]

Schaller and K

M. Schaller and K. Svozil, Partition logics of automata, Il Nuovo Cimento B109, 167 (1994)

work page 1994
[6]

Partition Logics, Orthoalgebras and Automata

A. Dvure ˇcenskij, S. Pulmannová, and K. Svozil, Partition log- ics, orthoalgebras and automata, Helvetica Physica Acta68, 407 (1995), arXiv:1806.04271

work page internal anchor Pith review Pith/arXiv arXiv 1995
[7]

Svozil,Quantum Logic, Discrete Mathematics and Theoret- ical Computer Science (Springer, Singapore, 1998)

K. Svozil,Quantum Logic, Discrete Mathematics and Theoret- ical Computer Science (Springer, Singapore, 1998)

work page 1998
[8]

Logical equivalence between generalized urn models and finite automata

K. Svozil, Logical equivalence between generalized urn mod- els and finite automata, International Journal of Theoretical Physics44, 745 (2005), arXiv:quant-ph/0209136

work page internal anchor Pith review Pith/arXiv arXiv 2005
[9]

C. Jendreiko, Generative logic: Teaching Prolog as generative AI in art and design, inWorkshop Proceedings of the 40th Inter- national Conference on Logic Programming (ICLP-WS 2024), CEUR Workshop Proceedings, V ol. 3799, edited by J. Arias et al.(CEUR-WS.org, Dallas, TX, 2024)

work page 2024
[10]

C. Jendreiko, The simple generative logic grammar: A tool for teaching logical thinking through visual research in art and design, inJoint Proceedings of the Workshops and Doctoral Consortium of the 41st International Conference on Logic Pro- gramming (ICLP-WS-DC 2025), CEUR Workshop Proceed- ings, V ol. 4117, edited by D. Azzoliniet al.(CEUR-WS.org, Rende, 2025)

work page 2025
[11]

R. J. Greechie, Orthomodular lattices admitting no states, Jour- nal of Combinatorial Theory. Series A10, 119 (1971)

work page 1971
[12]

Kochen and E

S. Kochen and E. P. Specker, The problem of hidden variables in quantum mechanics, Journal of Mathematics and Mechanics (now Indiana University Mathematics Journal)17, 59 (1967)

work page 1967
[13]

Lovász, On the Shannon capacity of a graph, IEEE Transac- tions on Information Theory25, 1 (1979)

L. Lovász, On the Shannon capacity of a graph, IEEE Transac- tions on Information Theory25, 1 (1979)

work page 1979
[14]

Grötschel, L

M. Grötschel, L. Lovász, and A. Schrijver, Relaxations of ver- tex packing, Journal of Combinatorial Theory, Series B40, 330 (1986)

work page 1986
[15]

Wright, Generalized urn models, Foundations of Physics20, 881 (1990)

R. Wright, Generalized urn models, Foundations of Physics20, 881 (1990)

work page 1990