On the public citation graph

Finite-valued reductions of infinite-valued logics

0 signed · 23 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.
Claim with ORCID
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.
See reference health

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.1016/0304-3975(87)90083-1openalex-snapshot
Satisfiability in many-valued sentential logic is NP-complete
inferredcites →https://doi.org/10.1023/a:1005026229560openalex-snapshot
Embedding Logics into Product Logic
inferredcites →https://doi.org/10.1023/a:1008311022292openalex-snapshot
Finiteness in Infinite-Valued Łukasiewicz Logic
inferredcites →https://doi.org/10.1090/s0002-9947-1958-0094302-9openalex-snapshot
Algebraic Analysis of Many Valued Logics
inferredcites →https://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferredcites →https://doi.org/10.1109/ismvl.2000.848617openalex-snapshot
Finite-valued approximations of product logic
inferredcites →https://doi.org/10.2307/2268660openalex-snapshot
A theorem about infinite-valued sentential 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-031-43513-3_21openalex-snapshot
The MaxSAT Problem in the Real-Valued MV-Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_33openalex-snapshot
Goal-Directed Calculi for Gödel-Dummett Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-04388-8_19openalex-snapshot
Finite Satisfiability in Infinite-Valued Łukasiewicz Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_2openalex-snapshot
Many-Valued and Fuzzy Logics
inferred← citeshttps://doi.org/10.1007/s00153-004-0225-3openalex-snapshot
Analytic Calculi for Product Logics
inferred← citeshttps://doi.org/10.1007/s00500-004-0443-yopenalex-snapshot
Complexity issues in basic logic
inferred← citeshttps://doi.org/10.1007/s10817-011-9227-0openalex-snapshot
Satisfiability Checking in Łukasiewicz Logic as Finite Constraint Satisfaction
inferred← citeshttps://doi.org/10.1016/b978-044451814-9/50010-0openalex-snapshot
Triangular norm-based mathematical fuzzy logics
inferred← citeshttps://doi.org/10.1016/j.ijar.2006.02.003openalex-snapshot
An asymptotically tight bound on countermodels for Łukasiewicz logic
inferred← citeshttps://doi.org/10.1109/ismvl.2002.1011077openalex-snapshot
Consequence and complexity in infinite-valued logic: a survey
inferred← citeshttps://doi.org/10.1109/ismvl.2004.1319917openalex-snapshot
Uniform description of calculi for all t-norm logics
inferred← citeshttps://doi.org/10.1109/ismvl.2007.33openalex-snapshot
Model-Characterizing Formulas and Normal Forms in Godel Logics
inferred← citeshttps://doi.org/10.1145/1071596.1071600openalex-snapshot
Sequent and hypersequent calculi for abelian and łukasiewicz logics
inferred← citeshttps://doi.org/10.2178/bsl/1208442828openalex-snapshot
Mathematical Fuzzy Logics
inferred← citeshttps://doi.org/10.48550/arxiv.0707.3205openalex-snapshot
Neutrality and Many-Valued Logics
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.