On the public citation graph
Normal forms in infinite-valued logic: The case of one variable
0 signed · 21 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/3-540-12920-0_25openalex-snapshot
Logic programs and many-valued logic
inferredcites →https://doi.org/10.1007/3-540-16780-3_90openalex-snapshot
Computational aspects of three-valued logic
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
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/s0747-7171(10)80002-1openalex-snapshot
A resolution framework for finitely-valued first-order logics
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1090/s0002-9947-1958-0094299-1openalex-snapshot
Fragments of Many-Valued Statement Calculi
inferredcites →https://doi.org/10.1093/oso/9780199219858.001.0001openalex-snapshot
An Introduction To The Theory Of Numbers
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.1006/aama.1998.0581openalex-snapshot
The Complexity of McNaughton Functions of One Variable
inferred← citeshttps://doi.org/10.1007/3-540-56804-2_5openalex-snapshot
Short CNF in finitely-valued logics
inferred← citeshttps://doi.org/10.1007/3-540-57322-4_18openalex-snapshot
A new translation from deduction into integer programming
inferred← citeshttps://doi.org/10.1007/978-94-011-0215-5_6openalex-snapshot
A proof of the completeness of the infinite-valued calculus of Łukasiewicz with one variable
inferred← citeshttps://doi.org/10.1007/978-94-017-0452-6_5openalex-snapshot
Advanced Many-Valued Logics
inferred← citeshttps://doi.org/10.1007/bf01530787openalex-snapshot
Many-valued logic and mixed integer programming
inferred← citeshttps://doi.org/10.1093/oso/9780198539896.001.0001openalex-snapshot
Automated Deduction in Multiple-valued Logics
inferred← citeshttps://doi.org/10.1145/315891.316093openalex-snapshot
Automatic thesaurus construction supporting fuzzy retrieval of reusable components
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.