arxiv: 2605.05273 · v1 · submitted 2026-05-06 · 💻 cs.LO

Recognition: unknown

A diagrammatic proof-theoretic semantics for the Greimas semiotic square

Michael Fowler

Pith reviewed 2026-05-08 16:26 UTC · model grok-4.3

classification 💻 cs.LO

keywords Greimas semiotic squarespider diagramsdiagrammatic proof systemstructural semanticsmeta-term formationnon-Boolean negationproof-theoretic semanticscontour introduction

0 comments

The pith

The four meta-terms of the Greimas semiotic square each arise from a uniform derivation schema applied to basic spider-diagram configurations.

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

The paper develops a spider-diagram proof system that interprets the Greimas semiotic square as a set of diagrammatic configurations and transformations. It establishes that each meta-term is obtained from a conjunctive pair of basic terms by applying the same fixed sequence of contour introduction and habitat transformation rules. This treats the semiotic combination operation as a constructive, rule-governed derivation rather than a Boolean or algebraic combination. The framework also shows that negation in the diagrams functions as a zone-restricted counter-position instead of a full complement, preserving the relational character of structural opposition. A reader would care because the result supplies an explicitly compositional and inferential semantics for generating complex semiotic structures from simpler ones.

Core claim

The central claim is that the construction of each of the four meta-terms can be captured uniformly: each is derivable from a conjunctive pair of basic configurations via a fixed derivation schema composed of contour introduction and habitat transformation rules. This yields a proof-theoretic account in which the Greimasian operation of combination is realized as a derivational construction, and in which diagrammatic negation appears as a restricted, zone-determined semantic counter-position rather than a Boolean complement, thereby reflecting the relational, non-Boolean character of opposition in structural semiotics.

What carries the argument

The fixed derivation schema of contour introduction and habitat transformation rules applied to conjunctive pairs of basic spider-diagram configurations.

If this is right

Complex semiotic terms are generated constructively from basic configurations by repeated application of the same small set of rules.
Proof trees serve as explicit witnesses for the formation of meta-terms and for the transformations between opposing terms.
The system supplies a compositional, rule-based semantics for a fragment of structural semantics that extends the reach of existing spider-diagram calculi.
Diagrammatic negation is interpreted as a zone-specific counter-position rather than a global complement.

Where Pith is reading between the lines

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

The same uniform schema could be tested on other semiotic structures that rely on relational opposition to see whether they admit similar diagrammatic derivations.
The approach suggests that certain non-classical semantic operations in the humanities might be formalized as restricted inference systems rather than as set-theoretic or Boolean constructions.
One could examine whether adding further spider-diagram rules would allow the framework to capture additional layers of Greimasian analysis, such as narrative sequences.

Load-bearing premise

The relations of contradiction and implication in the Greimas square can be faithfully captured by transformations under spider-diagram inference rules while keeping the non-Boolean, relational character of semiotic opposition intact.

What would settle it

A concrete counter-example would be any meta-term whose diagrammatic configuration cannot be obtained from its corresponding basic pair by applying only the contour introduction and habitat transformation rules, or whose derivation alters the intended semiotic relations of contradiction or implication.

read the original abstract

We develop a diagrammatic proof system for a fragment of structural semantics inspired by the Greimas semiotic square, using spider diagrams as the underlying formalism. The basic terms are represented as diagrammatic configurations, and the relations of contradiction and implication are interpreted as transformations governed by a set of inference rules. These transformations are realised as derivations, with proof trees serving as witnesses. Our main result shows that the construction of the four meta-terms can be captured uniformly: each is derivable from a conjunctive pair of basic configurations via a fixed derivation schema composed of contour introduction and habitat transformation rules. This yields a proof-theoretic account of the combinatorial operation underlying meta-term formation, and provides a semantic interpretation of the Greimasian operation `+' as a derivational construction rather than a logical combination. We further show that diagrammatic negation in this setting is not a Boolean complement, but a restricted, zone-determined semantic counter-position, reflecting the relational character of opposition in structural semiotics. The resulting framework provides a compositional, rule-based semantics in which complex configurations are generated constructively from simpler ones. In addition to extending the expressive scope of spider diagram calculi, the system illustrates how diagrammatic reasoning can be used to formalise non-classical semantic operations within a unified inferential setting.

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 uniform diagrammatic derivation for the Greimas meta-terms using spider diagrams and a non-Boolean negation.

read the letter

The paper develops a spider-diagram proof system for the Greimas semiotic square. It treats the four meta-terms as derivable from basic configurations through a fixed schema of contour introduction and habitat transformation rules, and it reads negation as a zone-restricted counter-position rather than Boolean complement. This turns the combinatorial operation into a constructive, rule-based process instead of a primitive logical step. The uniform schema and the relational reading of opposition are the clearest new pieces. The work extends existing spider-diagram calculi in a targeted way and keeps the semantics compositional. That is useful as far as it goes. The central claim looks internally consistent on the abstract, and the stress-test note finds no hidden inconsistency in the stated construction. The math is standard diagram manipulation with added rules, and there is no sign of circular definitions or free parameters. The weakest assumption is that the chosen inference rules will faithfully reproduce the intended contradiction and implication relations without forcing extra equivalences or losing the non-classical character. Without the actual rule definitions and at least one worked proof tree, that remains untested. The paper is a proposal at this stage rather than a fully verified system. It is aimed at readers who already work with diagrammatic logics or who want to see formal methods applied to structural semantics. Someone in proof theory or applied logic could pick up the uniform derivation idea for other constructs. I would send it to peer review because the framework is coherent and the niche can use concrete extensions like this, provided the full paper supplies the missing rule details and examples so referees can check the transformations directly.

Referee Report

1 major / 1 minor

Summary. The paper develops a diagrammatic proof system using spider diagrams for a fragment of structural semantics inspired by the Greimas semiotic square. Basic terms are represented as diagrammatic configurations, and relations of contradiction and implication are interpreted as transformations governed by inference rules. The main result shows that the four meta-terms can be captured uniformly, each derivable from a conjunctive pair of basic configurations via a fixed derivation schema of contour introduction and habitat transformation rules. This yields a proof-theoretic account of the combinatorial operation underlying meta-term formation and a semantic interpretation of negation as a restricted, zone-determined counter-position rather than Boolean complement.

Significance. This work has the potential to be significant in bridging diagrammatic proof theory with structural semiotics by providing a constructive, rule-based semantics. The uniform derivation schema is a notable strength, as it is presented as built from basic configurations without free parameters. The non-Boolean interpretation of negation aligns with the relational character of opposition in the Greimas square. If the derivations are sound and the interpretation faithful, it extends the expressive scope of spider diagram calculi to non-classical semantic operations.

major comments (1)

Abstract (main result paragraph): The claim that each of the four meta-terms is derivable via the fixed schema is central, but the abstract does not provide the specific contour introduction or habitat transformation rules, nor example proof trees. This makes it difficult to assess whether the transformations preserve the relational, non-Boolean character of opposition as stated, which is load-bearing for the main result.

minor comments (1)

The terminology 'habitat transformation rules' is introduced without prior definition in the abstract; a brief explanation or reference to their origin would improve clarity for readers unfamiliar with the formalism.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their thoughtful summary and for highlighting the central claim of the paper. We address the major comment point by point below, providing the strongest honest response based on the manuscript's content.

read point-by-point responses

Referee: Abstract (main result paragraph): The claim that each of the four meta-terms is derivable via the fixed schema is central, but the abstract does not provide the specific contour introduction or habitat transformation rules, nor example proof trees. This makes it difficult to assess whether the transformations preserve the relational, non-Boolean character of opposition as stated, which is load-bearing for the main result.

Authors: We acknowledge that the abstract presents the main result at a high level without enumerating the specific rules or including proof trees, which is standard for abstracts due to length constraints. The manuscript defines the contour introduction rules (e.g., the uniform schema for adding contours to represent meta-term formation) and habitat transformation rules in Section 3, with the fixed derivation schema formalized in Definition 4.1. Section 5 then provides explicit proof trees for each of the four meta-terms, demonstrating their derivation from conjunctive pairs of basic configurations. These derivations are shown to preserve the relational, non-Boolean semantics of opposition through the zone-determined counter-position interpretation of negation (detailed in Section 4.2), rather than Boolean complement. The soundness of the rules with respect to the Greimas square's combinatorial structure is established in Theorem 5.3. If the referee finds the abstract's phrasing insufficiently indicative, we can revise it to include a brief parenthetical reference to the rule types and the non-Boolean negation, while keeping the focus on the uniform schema. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper introduces spider-diagram configurations for basic terms and defines inference rules for contour introduction and habitat transformation to interpret contradiction and implication. The central result states that each meta-term is derivable from a conjunctive pair via one fixed schema using those rules. This is a constructive, rule-based derivation presented as extending existing spider-diagram calculi; the rules and configurations are independently motivated by the formalism rather than defined in terms of the target meta-terms. No load-bearing self-citation, fitted-parameter prediction, or self-definitional reduction appears in the abstract or claimed main result. The framework remains self-contained against external diagrammatic proof benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The framework rests on the domain assumption that spider diagrams can encode the relevant semantic relations and on newly introduced inference rules whose adequacy is not independently verified outside the paper.

axioms (1)

domain assumption Spider diagrams can represent basic terms and the relations of contradiction and implication from structural semantics.
The paper adopts spider diagrams as the underlying formalism and interprets semiotic relations directly as diagram transformations.

invented entities (1)

Habitat transformation rules no independent evidence
purpose: To realize the transformations corresponding to contradiction and implication in the semiotic square.
These rules are introduced as part of the new inference system and have no independent evidence supplied in the abstract.

pith-pipeline@v0.9.0 · 5521 in / 1482 out tokens · 38581 ms · 2026-05-08T16:26:47.416598+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

31 extracted references · 1 canonical work pages

[1]

1985 , author=

Quelques concepts fondamentaux en s\'. 1985 , author=

1985
[2]

1963 , author=

Essais de linguistique g\'. 1963 , author=

1963
[3]

2023 , eprint=

Proofs of valid categorical syllogisms in one diagrammatic and two symbolic axiomatic systems , author=. 2023 , eprint=

2023
[4]

Logica Universalis , volume=

Why the Logical Hexagon? , author=. Logica Universalis , volume=
[5]

Logica Universalis , volume=

The power of the hexagon , author=. Logica Universalis , volume=
[6]

Axioms , volume =

Fowler, Michael , title =. Axioms , volume =. 2025 , number =

2025
[7]

2012 , author =

Applications, implications and limitations of the semiotic square for analyzing advertising discourse and discerning alternative brand futures , journal =. 2012 , author =

2012
[8]

1991 , author =

Analyse s\'. 1991 , author =

1991
[9]

2003 , title =

Terence Hawkes , publisher =. 2003 , title =

2003
[10]

1989 , address=

A Semiotic Analysis of Genesis 2-3: A Semiotic Theory and Method of Analysis Applied to the Story of the Garden of Eden , author=. 1989 , address=

1989
[11]

1988 , address=

Maupassant: The semiotics of text , author=. 1988 , address=

1988
[12]

1982 , address=

Semiotics and Language: An Analytical Dictionary , author=. 1982 , address=

1982
[13]

and Howse, J

Gil, J. and Howse, J. and Kent, S. , booktitle=. Formalizing spider diagrams , year=. doi:10.1109/VL.1999.795884 , publisher=

work page doi:10.1109/vl.1999.795884 1999
[14]

Spider Diagrams: A Diagrammatic Reasoning System , journal =

John Howse and Fernando Molina and John Taylor and Stuart Kent and Joseph (Yossi) Gil , year =. Spider Diagrams: A Diagrammatic Reasoning System , journal =
[15]

Spider Diagrams , journal =

John Howse and Gem Stapleton and John Taylor , year =. Spider Diagrams , journal =
[16]

Speedith: A Reasoner for Spider Diagrams , journal =

Matej Urbas and Mateja Jamnik and Gem Stapleton , year =. Speedith: A Reasoner for Spider Diagrams , journal =
[17]

Lecture notes in computer science , author=

Diagrams. Lecture notes in computer science , author=. 2013 , title=

2013
[18]

On the expressiveness of spider diagrams and commutative star-free regular languages , journal =

Aiden Delaney and Gem Stapleton and John Taylor and Simon Thompson , year =. On the expressiveness of spider diagrams and commutative star-free regular languages , journal =
[19]

1983 , note =

Saussure, Ferdinand de , title =. 1983 , note =

1983
[20]

A. J. Greimas and F. Rastier , year =. The Interaction of Semiotic Constraints , journal =
[21]

1955 , author =

The Structural Study of Myth , journal =. 1955 , author =

1955
[22]

2020 , author =

An Introduction to Applied Semiotics: Tools for Text and Image Analysis , publisher =. 2020 , author =

2020
[23]

1983 , address =

Structural Semantics: An Attempt at a Method , author=. 1983 , address =

1983
[24]

A. J. Greimas , year =. On Meaning: Selected Writings in Semiotic Theory , publisher =
[25]

Sign System Studies , volume=

Eero Tarasti , title=. Sign System Studies , volume=
[26]

Key terms in semiotics , author =
[27]

Figurative Semiotics and the Semiotics of the Plastic Arts , journal=

Algirdas Julien Greimas and Frank Collins and Paul Perron , year=. Figurative Semiotics and the Semiotics of the Plastic Arts , journal=
[28]

Axioms , VOLUME =

Fowler, Michael , TITLE =. Axioms , VOLUME =. 2026 , NUMBER =

2026
[29]

1989 , author =

Paris school semiotics , address =. 1989 , author =

1989
[30]

2013 , eprint=

The operad of temporal wiring diagrams: formalizing a graphical language for discrete-time processes , author=. 2013 , eprint=

2013
[31]

1983 , publisher =

Semiotics and Pragmatics: An Evaluative Comparison of Conceptual Frameworks , author =. 1983 , publisher =

1983