On the public citation graph

Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik

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.
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.1016/s0049-237x(09)70277-0openalex-snapshot
Axiomatizability of some many valued predicate calculi
inferredcites →https://doi.org/10.2307/2268660openalex-snapshot
A theorem about infinite-valued sentential logic
inferredcites →https://doi.org/10.2307/2270410openalex-snapshot
Further results on infinite valued predicate logic
inferredcites →https://doi.org/10.2307/2271335openalex-snapshot
A weak completeness theorem for infinite valued first-order logic
inferredcites →https://doi.org/10.2307/2271339openalex-snapshot
Axiomatization of the infinite-valued predicate calculus
inferredcites →https://doi.org/10.2307/2964111openalex-snapshot
Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
inferredcites →https://doi.org/10.2307/2964677openalex-snapshot
On the definition of an infinitely-many-valued predicate calculus
inferredcites →https://doi.org/10.3929/ethz-a-000226207openalex-snapshot
Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik
inferredcites →https://doi.org/10.4064/fm-50-2-165-190openalex-snapshot
Axiomatizability of some many valued predicate calculi
inferredcites →https://doi.org/10.7146/math.scand.a-10706openalex-snapshot
On the Consistency of the Axiom of Comprehension in the Lukasiewicz Infinite Valued 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-540-75560-9_8openalex-snapshot
Monadic Fragments of Gödel Logics: Decidability and Undecidability Results
inferred← citeshttps://doi.org/10.1007/978-3-642-02261-6_10openalex-snapshot
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_9openalex-snapshot
A Resolution Mechanism for Prenex Gödel 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/bf02023020openalex-snapshot
Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre
inferred← citeshttps://doi.org/10.1016/j.apal.2009.05.015openalex-snapshot
Arithmetical complexity of fuzzy predicate logics — A survey II
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103826openalex-snapshot
On the local modal product logic: standard completeness and decidability
inferred← citeshttps://doi.org/10.1023/a:1005026229560openalex-snapshot
Embedding Logics into Product Logic
inferred← citeshttps://doi.org/10.1023/a:1016544704961openalex-snapshot
Monadic Fuzzy Predicate Logics
inferred← citeshttps://doi.org/10.2178/bsl/1208442828openalex-snapshot
Mathematical Fuzzy Logics
inferred← citeshttps://doi.org/10.2307/2687834openalex-snapshot
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000
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.