On the public citation graph
Poset Representation for Gödel and Nilpotent Minimum Logics
0 signed · 30 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.1007/978-94-011-5300-3openalex-snapshot
Metamathematics of Fuzzy Logic
inferredcites →https://doi.org/10.1007/pl00009890openalex-snapshot
A note on functions associated with Gödel formulas
inferredcites →https://doi.org/10.1007/s005000000044openalex-snapshot
Basic Fuzzy Logic is the logic of continuous t-norms and their residua
inferredcites →https://doi.org/10.1016/0304-3975(87)90083-1openalex-snapshot
Satisfiability in many-valued sentential logic is NP-complete
inferredcites →https://doi.org/10.1016/j.fss.2004.01.005openalex-snapshot
A fuzzy logic for an ordinal sum t-norm
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.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1109/fuzzy.1995.409964openalex-snapshot
Nilpotent minimum and related connectives for fuzzy logic
inferredcites →https://doi.org/10.2307/2268660openalex-snapshot
A theorem about infinite-valued sentential logic
inferredcites →https://doi.org/10.2307/2270905openalex-snapshot
Logic with truth values in A linearly ordered heyting algebra
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.
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-540-75256-1_17openalex-snapshot
Best Approximation of Ruspini Partitions in Gödel Logic
inferred← citeshttps://doi.org/10.1007/s00153-012-0317-4openalex-snapshot
First-order Nilpotent minimum logics: first steps
inferred← citeshttps://doi.org/10.1007/s11225-008-9142-5openalex-snapshot
De Finetti’s No-Dutch-Book Criterion for Gödel logic
inferred← citeshttps://doi.org/10.1007/s11225-010-9228-8openalex-snapshot
Probability Measures in the Logic of Nilpotent Minimum
inferred← citeshttps://doi.org/10.1016/j.fss.2007.05.004openalex-snapshot
Characterizations of maximal consistent theories in the formal deductive system (NM-logic) and Cantor space
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.2014.07.007openalex-snapshot
On some questions concerning the axiomatisation of WNM-algebras and their subvarieties
inferred← citeshttps://doi.org/10.1016/j.ijar.2009.02.007openalex-snapshot
An analysis of Ruspini partitions in Gödel logic
inferred← citeshttps://doi.org/10.1016/j.ijar.2013.10.007openalex-snapshot
A temporal semantics for Nilpotent Minimum logic
inferred← citeshttps://doi.org/10.1016/s1874-5857(07)80009-4openalex-snapshot
Fuzzy-Set Based Logics — an History-Oriented Presentation of their Main Developments
inferred← citeshttps://doi.org/10.1109/fuzz-ieee.2016.7737687openalex-snapshot
A linear space decision procedure for Gödel propositional logic
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681979openalex-snapshot
Comparing the Expressive Power of Some Fuzzy Logics Based on Residuated t-norms
inferred← citeshttps://doi.org/10.1109/fuzzy.2007.4295542openalex-snapshot
Propositional Gödel Logic and Delannoy Paths
inferred← citeshttps://doi.org/10.1109/ismvl.2010.13openalex-snapshot
The Automorphism Group of Finite Godel Algebras
inferred← citeshttps://doi.org/10.1109/ismvl.2017.21openalex-snapshot
Computing Uniform Interpolants in Nilpotent Minimum Logic
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.