On the public citation graph
The unsolvability of the Gödel class with identity
0 signed · 77 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/bf01448023openalex-snapshot
Über die Erfüllbarkeit einer Klasse von logischen Formeln
inferredcites →https://doi.org/10.1007/bf01449155openalex-snapshot
Untersuchungen zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bf01452848openalex-snapshot
Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
inferredcites →https://doi.org/10.1007/bf01708881openalex-snapshot
Zum Entscheidungsproblem des logischen Funktionenkalküls
inferredcites →https://doi.org/10.1007/bf02021316openalex-snapshot
Contributions to the reduction theory of the decision problem
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1017/s0022481200051513openalex-snapshot
The decision problem for standard classes
inferredcites →https://doi.org/10.1073/pnas.48.3.365openalex-snapshot
ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
inferredcites →https://doi.org/10.1109/proc.1964.3109openalex-snapshot
Proceedings of the symposium on mathematical theory of Automata
inferredcites →https://doi.org/10.1112/plms/s2-30.1.264openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.2307/2267211openalex-snapshot
On the reduction of the decision problem
inferredcites →https://doi.org/10.2307/2312510openalex-snapshot
Reduktionstheorie des Entscheidungsproblems im Pradikatenkalkul der Ersten Stufe.
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19860323503openalex-snapshot
Ein Neuer Beweis und Eine Verschärfung für den Konservativen Reduktionstyp ∀∃∀∃∞(0, 1)
inferred← citeshttps://doi.org/10.1002/malq.200510010openalex-snapshot
The ultra-weak Ash conjecture and some particular cases
inferred← citeshttps://doi.org/10.1006/jsco.1999.0360openalex-snapshot
Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-45744-5_16openalex-snapshot
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_21openalex-snapshot
Complexity of formula classes in first order logic with functions
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_47openalex-snapshot
Ordered paramodulation and resolution as decision procedure
inferred← citeshttps://doi.org/10.1007/978-3-030-88853-4_13openalex-snapshot
On the Subtle Nature of a Simple Logic of the Hide and Seek Game
inferred← citeshttps://doi.org/10.1007/978-3-031-91361-7_8openalex-snapshot
A Modal Logic for the Hide and Seek Game
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_15openalex-snapshot
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_4openalex-snapshot
Decidable Fragments of Many-Sorted Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-58771-3_10openalex-snapshot
Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-7091-6470-9_3openalex-snapshot
Logical contributions to the Menger colloquium
inferred← citeshttps://doi.org/10.1007/978-94-011-3552-8_2openalex-snapshot
Tautology: How not to Use a Word
inferred← citeshttps://doi.org/10.1007/bf01651329openalex-snapshot
Satisfiability of formulae with one ∀ is decidable in exponential time
inferred← citeshttps://doi.org/10.1007/bfb0026298openalex-snapshot
Size of models versus length of computations
inferred← citeshttps://doi.org/10.1007/s00012-004-1856-2openalex-snapshot
Varieties of two-dimensional cylindric algebras II
inferred← citeshttps://doi.org/10.1007/s11225-015-9647-7openalex-snapshot
The Decision Problem of Modal Product Logics with a Diagonal, and Faulty Counter Machines
inferred← citeshttps://doi.org/10.1007/s11225-023-10039-4openalex-snapshot
A Simple Logic of the Hide and Seek Game
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90146-6openalex-snapshot
Implication of clauses is undecidable
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.03.003openalex-snapshot
Decidable fragments of many-sorted logic
inferred← citeshttps://doi.org/10.1023/a:1023383112908openalex-snapshot
All Proper Normal Extensions of S5-square have the Polynomial Size Model Property
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.001.0001openalex-snapshot
Fragments of First-Order Logic
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0007openalex-snapshot
Counting with one variable
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0008openalex-snapshot
Counting with two variables
inferred← citeshttps://doi.org/10.1093/oso/9780192867964.003.0013openalex-snapshot
Equivalence and counting
inferred← citeshttps://doi.org/10.1093/philmat/nkj011openalex-snapshot
Godel's Correspondence on Proof Theory and Constructive Mathematics: KURT GODEL. Collected Works. Volume IV: Selected Correspondence A-G; Volume V: Selected Correspondence H-Z. Solomon Feferman, John W. Dawson, Warren Goldfarb, Charles Parsons, and Wilfried Sieg, eds. Oxford: Oxford University…
inferred← citeshttps://doi.org/10.1109/lics.1991.151652openalex-snapshot
On the 0-1 law for the class of existential second order minimal Godel sentences with equality
inferred← citeshttps://doi.org/10.1109/lics.1997.614958openalex-snapshot
Complexity of two-variable logic with counting
inferred← citeshttps://doi.org/10.1109/lics.1999.782582openalex-snapshot
The two-variable guarded fragment with transitive relations
inferred← citeshttps://doi.org/10.1109/lics.2005.49openalex-snapshot
Small Substructures and Decidability Issues for First-Order Logic with Two Variables
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267755openalex-snapshot
Undecidability of the Horn-clause implication problem
inferred← citeshttps://doi.org/10.1137/s0097539797323005openalex-snapshot
Complexity Results for First-Order Two-Variable Logic with Counting
inferred← citeshttps://doi.org/10.1145/3242953.3242958openalex-snapshot
Two-variable logics with counting and semantic constraints
inferred← citeshttps://doi.org/10.1145/3661814.3662097openalex-snapshot
On the complexity of Maslov's class K
inferred← citeshttps://doi.org/10.22028/d291-25860openalex-snapshot
Saturation-based decision procedures for extensions of the guarded fragment
inferred← citeshttps://doi.org/10.2307/2274275openalex-snapshot
A decidable subclass of the minimal Gödel class with identity
inferred← citeshttps://doi.org/10.2307/421196openalex-snapshot
On the Decision Problem for Two-Variable First-Order Logic
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2019.16openalex-snapshot
One-Dimensional Guarded Fragments
inferred← citeshttps://doi.org/10.48550/arxiv.1911.11500openalex-snapshot
Separateness of Variables -- A Novel Perspective on Decidable First-Order Fragments
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.