On the public citation graph
Spectral Duality for Finitely Generated Nilpotent Minimum Algebras, with Applications
0 signed · 40 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.200510027openalex-snapshot
Free nilpotent minimum algebras
inferredcites →https://doi.org/10.1007/978-1-4757-3627-4_3openalex-snapshot
A Survey of Residuated Lattices
inferredcites →https://doi.org/10.1007/978-94-011-5300-3openalex-snapshot
Metamathematics of Fuzzy Logic
inferredcites →https://doi.org/10.1007/978-94-015-9936-8openalex-snapshot
Sheaves, Games, and Model Completions
inferredcites →https://doi.org/10.1007/978-94-017-3598-8_8openalex-snapshot
Substructural Logics and Residuated Lattices — an Introduction
inferredcites →https://doi.org/10.1007/bf00403332openalex-snapshot
Logical matrices and the amalgamation property
inferredcites →https://doi.org/10.1007/s00153-002-0165-8openalex-snapshot
On the structure of rotation-invariant semigroups
inferredcites →https://doi.org/10.1007/s11225-006-8305-5openalex-snapshot
Algebraization, Parametrized Local Deduction Theorem and Interpolation for Substructural Logics over FL
inferredcites →https://doi.org/10.1016/j.apal.2005.12.015openalex-snapshot
Computing coproducts of finitely presented Gödel algebras
inferredcites →https://doi.org/10.1016/s0165-0114(01)00098-7openalex-snapshot
Monoidal t-norm based logictowards a logic for left-continuous t-norms
inferredcites →https://doi.org/10.1016/s0165-0114(03)00138-6openalex-snapshot
A characterization of truth-functions in the nilpotent minimum logic
inferredcites →https://doi.org/10.1023/a:1015122331293openalex-snapshot
A Proof of Standard Completeness for Esteva and Godo's Logic MTL
inferredcites →https://doi.org/10.1090/s0002-9947-1976-0412063-9openalex-snapshot
Dualities for Equational Classes of Brouwerian Algebras and Heyting Algebras
inferredcites →https://doi.org/10.1093/acprof:oso/9780198511748.001.0001openalex-snapshot
Interpolation and Definability
inferredcites →https://doi.org/10.1109/fuzzy.2006.1681979openalex-snapshot
Comparing the Expressive Power of Some Fuzzy Logics Based on Residuated t-norms
inferredcites →https://doi.org/10.1112/blms/6.1.115openalex-snapshot
CATEGORIES FOR THE WORKING MATHEMATICIAN
inferredcites →https://doi.org/10.3233/fun-2004-59401openalex-snapshot
Analytic Calculi for Monoidal T-norm Based Logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_11openalex-snapshot
Counting Finite Linearly Ordered Involutive Bisemilattices
inferred← citeshttps://doi.org/10.1007/978-3-031-74000-8_30openalex-snapshot
Counting Homomorphisms Between Finite Gödel Algebras
inferred← citeshttps://doi.org/10.1007/978-3-662-59565-7_15openalex-snapshot
Spectra of Gödel Algebras
inferred← citeshttps://doi.org/10.1007/s00153-012-0317-4openalex-snapshot
First-order Nilpotent minimum logics: first steps
inferred← citeshttps://doi.org/10.1007/s00500-016-2340-6openalex-snapshot
Free weak nilpotent minimum algebras
inferred← citeshttps://doi.org/10.1007/s11225-010-9228-8openalex-snapshot
Probability Measures in the Logic of Nilpotent Minimum
inferred← citeshttps://doi.org/10.1007/s11225-017-9766-4openalex-snapshot
Finitary Extensions of the Nilpotent Minimum Logic and (Almost) Structural Completeness
inferred← citeshttps://doi.org/10.1016/j.fss.2007.12.003openalex-snapshot
Normal forms and free algebras for some extensions of MTL
inferred← citeshttps://doi.org/10.1016/j.fss.2013.11.004openalex-snapshot
The logical content of triangular bases of fuzzy sets in Łukasiewicz infinite-valued logic
inferred← citeshttps://doi.org/10.1016/j.fss.2014.07.007openalex-snapshot
On some questions concerning the axiomatisation of WNM-algebras and their subvarieties
inferred← citeshttps://doi.org/10.1016/j.ijar.2013.10.007openalex-snapshot
A temporal semantics for Nilpotent Minimum logic
inferred← citeshttps://doi.org/10.1093/logcom/exab076openalex-snapshot
Monadic NM-algebras: an algebraic approach to monadic predicate nilpotent minimum logic
inferred← citeshttps://doi.org/10.1093/logcom/exr006openalex-snapshot
Finite RDP-algebras: duality, coproducts and logic
inferred← citeshttps://doi.org/10.1109/fuzz48607.2020.9177714openalex-snapshot
Automorphism groups of Lindenbaum algebras of some propositional many-valued logics with locally finite algebraic semantics
inferred← citeshttps://doi.org/10.1109/fuzz62266.2025.11152105openalex-snapshot
Intuitionistic Fuzzy Logic and Prelinearity: Benefit from Multiplicative Disjunction and Infinitesimal
inferred← citeshttps://doi.org/10.1109/ismvl.2015.19openalex-snapshot
Valuations in Nilpotent Minimum Logic
inferred← citeshttps://doi.org/10.1109/ismvl.2017.21openalex-snapshot
Computing Uniform Interpolants in Nilpotent Minimum Logic
inferred← citeshttps://doi.org/10.13130/m-bianchi_phd2010-12-17openalex-snapshot
ON SOME AXIOMATIC EXTENSIONS OF THE MONOIDAL T-NORM BASED LOGIC MTL: AN ANALYSIS IN THE PROPOSITIONAL AND IN THE FIRST-ORDER CASE
inferred← citeshttps://doi.org/10.15439/2020f169openalex-snapshot
Computing Duals of Finite Gödel Algebras
inferred← citeshttps://doi.org/10.2991/eusflat.2011.127openalex-snapshot
Nilpotent Minimum Fuzzy Description Logics
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10540openalex-snapshot
Counting finite linearly ordered involutive bisemilattices
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.