Pith. sign in

REVIEW 3 major objections 5 minor 17 references

$L$-Topology via Generalised Geometric Logic

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Pith's one-line read The paper claims that generalised geometric logic—first-order logic whose predicates are interpreted as lattice-valued relations—is the logic from which L-topology can be studied, with constructions passing in both directions.

desk verdict Genuine extension of fuzzy geometric logic to arbitrary frames, but rule 9 is unsound as stated and the collection of formulae is silently treated as a set; both issues are repairable. read the letter →

arxiv 1909.02106 v1 pith:2GTEL4NP submitted 2019-08-25 math.LO

classification math.LO MSC 03B5003C9006D2254A40
keywords generalisedgeometriclogicL-topologicalsystemspacegradedsatisfiabilitymany-valuedframelattice-valuedrelationspatiality
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

Generalised geometric logic is this paper's answer to the question of which logic L-topology can be studied from. The logic is geometric logic with a graded satisfaction relation: a sequence assigns each formula a truth degree in a frame $L$ (a complete lattice in which finite meets distribute over arbitrary joins), so predicate symbols are interpreted as $L$-valued relations. For any set of assignments, the formulas modulo semantic equivalence form a frame $A/{\approx}$, and $(X, \models', A/{\approx})$ is an $L$-topological system; applying the extension operator turns this system into an $L$-topological space. In the reverse direction, every $L$-topological space is shown to determine a theory in the propositional fragment of the logic, with each point supplying a model. If the claims are correct, L-topology becomes a branch of many-valued geometric logic.

What carries the argument

The central object is generalised geometric logic: geometric logic extended so that every predicate symbol is interpreted as an $L$-valued relation and every formula receives a grade of satisfaction in $L$. The load-bearing construction is the quotient $A/{\approx}$ of geometric formulas by semantic equivalence, where $\varphi\approx\psi$ iff $\operatorname{gr}(s \operatorname{sat} \varphi)=\operatorname{gr}(s \operatorname{sat} \psi)$ for every assignment $s$. Its order is read off from valid sequents, and the inference rules are used to prove that $A/{\approx}$ is a frame; the maps $\models'$ and $\operatorname{ext}$ then carry that frame structure back to the assignments as an $L$-topological system and an $L$-topological space.

What would settle it

Test the soundness of rule 9, the sequent $\varphi \wedge \exists y\,\psi \vdash \exists y\,(\varphi\wedge\psi)$, with $L=[0,1]$, $D=\{0,1\}$, $\varphi=P(y)$, $\psi=Q(y)$, and an assignment $s$ with $s(y)=0$, choosing $P(0)=1$, $P(1)=0$, $Q(0)=0$, $Q(1)=1$. Then $\operatorname{gr}(s \operatorname{sat} \varphi \wedge \exists y\,\psi)=1$ while $\operatorname{gr}(s \operatorname{sat} \exists y\,(\varphi\wedge\psi))=0$, so the sequent is not valid; this refutes the claimed soundness of the inference rules as stated.

Watch

Extended reading notes

Core claim

The paper's central claim is that generalised geometric logic is the appropriate logic for L-topology. On the satisfaction side, a formula $\varphi$ and an assignment $s$ are related by a grade $\operatorname{gr}(s \operatorname{sat} \varphi)$ in a frame $L$, with clauses for conjunction, arbitrary disjunction, and existential quantification. Two formulas are identified when every assignment gives them the same grade; the quotient $A/{\approx}$ is a frame under the order induced by valid sequents, and the relation $\models'$ makes $(X, \models', A/{\approx})$ an $L$-topological system. The extension map $\operatorname{ext}([\varphi])(s)=\operatorname{gr}(s \operatorname{sat} \varphi)$ then produces an $L$-topological space. Conversely, the paper attaches to an $L$-topological space a propositional generalised geometric theory whose axioms encode inclusion, finite intersection, and arbitrary union of $L$-open sets, and each point of the space is a model of that theory. The conclusion drawn is that L-topology can be studied through this logic.

Load-bearing premise

The construction treats the collection of all geometric formulas, built with joins indexed by arbitrary sets, as a set; if that collection is a proper class, $A/{\approx}$ is not a frame and the passage from logic to L-topology fails.

Editorial extensions

If this is right

  • Every $L$-topological space can be presented as the space of models of a propositional geometric theory, so topological statements about it can be read as logical consequences of that theory.
  • Any set of assignments carries a canonical $L$-topology whose $L$-open sets are exactly the semantically definable properties, with membership degree $\operatorname{gr}(s \operatorname{sat} \varphi)$.
  • The $L$-topological system obtained from the logic is spatial, so by the categorical equivalence quoted in the paper it is equivalent to the $L$-topological space it generates.
  • With $L=[0,1]$, the generalised logic and the construction reduce to fuzzy geometric logic and fuzzy topological systems, recovering the earlier framework as a special case.
  • Because $L$ can be any frame, the semantics can represent situations with incomparable truth values, not only linearly ordered ones.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: the two-way correspondence points toward a duality between $L$-topological spaces and geometric theories, but the paper does not specify the morphisms on the theory side; making that duality explicit would be a natural next step.
  • Editorial inference: equality in the logic is crisp, taking only the degrees $1_L$ and $0_L$, so the language is not fully many-valued; replacing equality by an $L$-valued relation would change the quotient frame and is a directly testable variant.
  • Editorial inference: the construction on an arbitrary set of assignments suggests defining the $L$-topology of a theory as the extension of its semantic quotient; a natural test would be whether two theories with the same semantic consequence relation always induce the same $L$-topological space.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces 'generalised geometric logic', a first-order language with conjunction, arbitrary set-indexed disjunction, existential quantification, equality, and L-valued predicate symbols. Satisfaction of a formula by a sequence is graded in a frame L, and a sequent is valid when the grade of its antecedent is at most that of its succedent in every interpretation. The paper states a sequent calculus and proves (or attempts to prove) its soundness in Theorem 3.11. It then takes the collection of geometric formulae modulo semantic equivalence A/≈, proves that (X, |=′, A/≈) is an L-topological system, and derives an L-topological space via extensions. Conversely, every L-topological space is encoded as a propositional theory in the logic, supporting the central claim that L-topology can be studied via generalised geometric logic.

Significance. The question 'from which logic can L-topology be studied?' is natural and the paper gives a direct, non-circular syntactic-semantic construction anchored to an independent categorical equivalence (Theorem 2.7). The main idea—building the frame of an L-topological system as the Lindenbaum–Tarski-style quotient of the logic—is attractive and extends the author's earlier fuzzy geometric logic work. However, the paper's soundness theorem is false as stated because of a missing variable condition in one inference rule, and the set-theoretic status of the collection of all geometric formulae is not addressed. Both issues are load-bearing for the logical-topological bridge and must be repaired. There are no machine-checked proofs or reproducibility artifacts; the proofs are short and mostly transparent. If the identified gaps are fixed, the paper would be a useful contribution to lattice-valued topology and geometric logic.

major comments (3)
  1. [Section 3.2, Rule 9 and Theorem 3.11] Rule 9, φ∧(∃y)ψ ⊢ (∃y)(φ∧ψ), is not universally valid without a side condition. In the proof of Theorem 3.11 the equality gr(s sat φ) ∧ sup_d gr(s(d/y) sat ψ) = sup_d (gr(s sat φ) ∧ gr(s(d/y) sat ψ)) is followed by the inequality ≤ sup_d (gr(s(d/y) sat φ) ∧ gr(s(d/y) sat ψ)); this step requires gr(s sat φ) ≤ gr(s(d/y) sat φ) for every d, which is not guaranteed and in general follows only if y is not free in φ. The failure is concrete: take L={0,1}, D={0,1}, I(c)=0, P(0)=0, P(1)=1, and a sequence s with s(y)=1; for φ=P(y) and ψ=(y=c), gr(s sat φ∧∃yψ)=1 while gr(s sat ∃y(φ∧ψ))=0. Thus Theorem 3.11 is false as stated, and the calculus must add a freshness condition such as y∉FV(φ) to Rule 9 before derivability can support the logical route to L-topology.
  2. [Section 4, paragraph before Theorem 4.1 and Theorem 4.3] Section 4 takes A to be 'the set of geometric formulae', but under Definition 3.2 the class of geometric formulae is a proper class: for every set I, ⋁_{i∈I} ⊤ is a geometric formula, and the formula encodes its index set I, so a set-sized collection cannot contain one such formula for every set I. Consequently A/≈ is not automatically a quotient set, and (X, |=′, A/≈) is not immediately an L-topological system in the standard sense. This is repairable: for set-sized X and L, the map [φ] ↦ (s ↦ gr(s sat φ)) injects A/≈ into L^X, so the quotient (or its semantic image) is a set; the paper should state this restriction or work with a set-sized sublanguage.
  3. [Section 4, Theorem 4.3] The proof that A/≈ is a frame is incomplete: after defining [φ]≤[ψ] by the validity of φ⊢ψ, it asserts 'Similarly arbitrary join exists in A/≈' without defining the join or verifying the least-upper-bound property. Since completeness of A/≈ is essential for the triple to be an L-topological system, this is load-bearing. The intended join is [⋁_{i∈I} φ_i], and the paper should explicitly prove that this is the least upper bound using rules 4(i) and 4(ii) rather than asserting it.
minor comments (5)
  1. [Title page and References] There are typos: 'I ndia' on the title page and 'Compuetation' in reference [15].
  2. [Definition 3.4] The recursive definition of φ[t/x] does not cover the case where φ is ∃xψ and the substituted variable is x; the clause only handles 'xi other than x'.
  3. [Rules 7 and 8] The notations ψ[x|y] and ((y1,...,yn)|(x1,...,xn)) are used without definition; tuple substitution should be defined explicitly.
  4. [Proposition 4.1] The quantifier structure is ambiguous: 'for all s∈X, (gr(s |=′ [φ]) = gr(s |=′ [ψ])) implies ([φ] = [ψ])' should read 'if gr(s |=′ [φ]) = gr(s |=′ [ψ]) for all s∈X, then [φ] = [ψ]'.
  5. [Section 5] The converse construction says 'All other axioms for the (propositional) generalised geometric logic will follow from the above clauses'; this should be spelled out for the propositional fragment rather than left as a sketch.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the logic-to-topology construction is a direct semantics-based representation theorem, not a renamed fit.

full rationale

The paper's central derivation is self-contained. The graded satisfaction relation is defined independently from the language and from L-frame interpretations of predicates, and the L-topological system (X, |=', A/≈) is then constructed directly from these semantics by quotienting formulae according to equal satisfaction grades (Definition 4.2, Theorem 4.3). The frame identities on A/≈ are established from the semantic clauses for conjunction and join, together with the geometric rules, rather than by assuming the target L-topology. The converse direction in Section 5 reads an L-topological space as a set of propositional axioms, and the claimed correspondence invokes the external categorical equivalence Theorem 2.7, not a conclusion already built into the construction. The self-citations [1], [6], and [7] are motivational or concern prior incremental work; none is used to force the main logic-to-topology result. A separate proof-theoretic defect exists: rule 9 in Theorem 3.11 is unsound without the side condition that y is not free in φ. However, that is a correctness issue, not circularity, and it does not make the represented topology equal to the input of the construction. Thus no circular step is found.

Assumptions & free parameters 0 free parameters · 4 assumptions · 1 invented entities

The construction depends on the setness of the formula class, on the soundness of the inference rules (which fails for rule 9), and on the standard categorical equivalence imported from prior work. No free parameters are fitted. The invented entity is the logic itself, which is a definition rather than a physical postulate.

assumptions (4)
  • ad hoc to paper The class of all geometric formulae with arbitrary set-indexed joins is a set, so the quotient A/≈ is a set and can be a frame.
    Invoked in Section 4, Theorem 4.3, without justification. With countably many symbols and joins over arbitrary sets, the cumulative collection of formulas is potentially a proper class. The paper does not restrict the index sets or prove setness.
  • domain assumption All rules of inference for generalised geometric logic are sound.
    Theorem 3.11 asserts this, but rule 9 is unsound without the side condition that y is not free in φ. Since the frame structure of A/≈ relies on the derivability of sequents, the unsoundness undermines the logical basis of the construction.
  • standard math The categorical equivalence of spatial L-topological systems and L-topological spaces (Theorem 2.7) holds for every frame L.
    Imported from Denniston, Melton, and Rodabough [3]. Used in Section 5 to equate the spatial system with the resulting L-topological space.
  • standard math L is a frame, so sups and meets behave as required by the logic's semantics.
    This is the underlying domain assumption in Definition 2.1 and Definition 3.5.
invented entities (1)
  • Generalised geometric logic
    purpose: A first-order logic with L-valued (frame-valued) predicates and graded satisfiability, intended as a logical foundation for L-topology.
    A newly defined formal language in Section 3. It is not a physical entity and has no external falsifiable handle; its value lies entirely in the theorems proved with it.

how reviews work

0 comments
Cite this review

Pith. "Pith review of $L$-Topology via Generalised Geometric Logic." pith.science (2026). https://pith.science/paper/2GTEL4NP

@misc{pith2026190902106,
  author       = {Pith},
  title        = {Pith review of: $L$-Topology via Generalised Geometric Logic},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2GTEL4NP}},
  note         = {Machine review of arXiv:1909.02106}
}
read the original abstract

This paper introduces a notion of generalised geometric logic. Connections of generalised geometric logic with L-topological system and L-topological space are established.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

17 extracted references · 17 canonical work pages

  1. [1]

    M. K. Chakraborty, P. Jana, Fuzzy topology via fuzzy geometric logic with graded consequence, International Journal of Approximate Reasoning, 80, 2017, pp. 334–347. 13

  2. [2]

    C. L. Chang, Fuzzy topological spaces, J. Math. Anal. Appl., 24, 1968, pp. 182–190

  3. [3]

    J. T. Denniston, A. Melton, and S. E. Rodabough, Interweaving algebra and topology: Lattice-valued topological systems , Fuzzy Sets and Systems, 192, 2012, pp. 58–103

  4. [4]

    Hajek, Mathematics of Fuzzy Logic , Kluwer Academic Publishers, Dor- drecht, Boston, London, 1998

    P. Hajek, Mathematics of Fuzzy Logic , Kluwer Academic Publishers, Dor- drecht, Boston, London, 1998

  5. [5]

    H¨ ohle, Fuzzy topologies and topological space objects in a topos , Fuzzy Sets and Systems, 19, 1986, pp

    U. H¨ ohle, Fuzzy topologies and topological space objects in a topos , Fuzzy Sets and Systems, 19, 1986, pp. 299–304

  6. [6]

    Jana, Topological systems, Topology and Frame: in fuzzy context , Remi- niscing Ideas and Interactions, Essays in honour of Mihir Kr

    P. Jana, Topological systems, Topology and Frame: in fuzzy context , Remi- niscing Ideas and Interactions, Essays in honour of Mihir Kr. Chakr aborty, Calcutta Logic Circle, Kolkata, 2011, p. 142

  7. [7]

    Jana and M

    P. Jana and M. K. Chakraborty, Categorical relationships of fuzzy topolog- ical systems with fuzzy topological spaces and underlying a lgebras, Ann. of Fuzzy Math. and Inform., 8, 2014, no. 5, pp. 705–727

  8. [8]

    P. T. Johnstone, Topos Theory, Academic Press, London, 1977

Show all 17 references
  1. [9]

    Mac Lane and I

    S. Mac Lane and I. Moerdijk, Sheaves in Geometry and Logic , Springer Verlag, 1992

  2. [10]

    Nov´ ak,First order fuzzy logic , Studia Logica, 46, 1987, pp

    V. Nov´ ak,First order fuzzy logic , Studia Logica, 46, 1987, pp. 87–109

  3. [11]

    Pavelka, On fuzzy logic , Zeitschrift fur Math Logik und Grudlagen der Mathematik, 25(1), pp

    J. Pavelka, On fuzzy logic , Zeitschrift fur Math Logik und Grudlagen der Mathematik, 25(1), pp. 45–52

  4. [12]

    Solovyov, Variable-basis topological systems versus variable-basi s topo- logical spaces, Soft Comput., 14, 2010, no

    S. Solovyov, Variable-basis topological systems versus variable-basi s topo- logical spaces, Soft Comput., 14, 2010, no. 10, pp. 1059–1068

  5. [13]

    S. J. Vickers, Geometric Logic in Computer Science , in: Proceedings of the First Imperial College Department of Computing Workshop on Th eory and Formal Methods, Springer-Verlag, London, UK, ISBN: 3-540 -19842-3, 1993, pp. 37–54. 14

  6. [14]

    S. J. Vickers, Issues of logic, algebra and topology in ontology , in: R. Poli, M. Healy, A. Kameas (Eds.), Theory and Applications of Ontology: Co m- puter Applications, volume 2 of Theory and Applications of Ontology, 2010

  7. [15]

    S. J. Vickers, Topology via Constructive Logic , in Logic, Language and Compuetation, 1999

  8. [16]

    S. J. Vickers, Topology Via Logic , volume 5, Cambridge Tracts Theoret. Comput. Sci., 1989

  9. [17]

    L. A. Zadeh, Fuzzy sets, Information and Control, 8, 1965, pp. 338–353. 15

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.