On the public citation graph

Certain Logical Reduction and Decision Problems

https://doi.org/10.2307/1969974
0 signed · 36 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19920380126openalex-snapshot
THE AMBIGUOUS TYPE THEORY IS HEREDITARILY UNDECIDABLE
inferred← citeshttps://doi.org/10.1007/3-540-45653-8_14openalex-snapshot
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-1-4020-4108-2_4openalex-snapshot
Quantifiers in Natural Languages: Some Logical Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-98479-3_11openalex-snapshot
Decidable and Undecidable Problems for First-Order Definability and Modal Definability
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-94-009-2727-8_9openalex-snapshot
Quantifiers in Natural Languages: Some Logical Problems, I
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_6openalex-snapshot
Algorithms and Decision Problems: A Crash Course in Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-94-009-9825-4_16openalex-snapshot
Quantifiers in Natural Languages: Some Logical Problems, I
inferred← citeshttps://doi.org/10.1007/978-94-015-9833-0_4openalex-snapshot
Algorithms and Decision Problems: A Crash Course in Recursion Theory
inferred← citeshttps://doi.org/10.1007/bf00351101openalex-snapshot
Quantifiers in natural languages: Some logical problems II
inferred← citeshttps://doi.org/10.1007/bf00500112openalex-snapshot
First-order modal theories III — Facts
inferred← citeshttps://doi.org/10.1007/bf02025119openalex-snapshot
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
inferred← citeshttps://doi.org/10.1007/bfb0022463openalex-snapshot
On properties preserved by contractions of concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0090948openalex-snapshot
Some decision problems for subtheories of two-dimensional partial orderings
inferred← citeshttps://doi.org/10.1007/s00153-004-0231-5openalex-snapshot
On the predicate logics of continuous t-norm BL-algebras
inferred← citeshttps://doi.org/10.1007/s11787-022-00299-4openalex-snapshot
Modal Definability: Two Commuting Equivalence Relations
inferred← citeshttps://doi.org/10.1016/j.apal.2005.04.003openalex-snapshot
Succinct definitions in the first order theory of graphs
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70009-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70458-6openalex-snapshot
Thirty Years of Foundational Studies Lectures on the Development of Mathematical Logic and the Study of the Foundations of Mathematics in 1930–1964
inferred← citeshttps://doi.org/10.1093/logcom/exv094openalex-snapshot
Undecidable problems for modal definability: Table 1.
inferred← citeshttps://doi.org/10.1093/logcom/exx033openalex-snapshot
Modal correspondence theory in the class of all Euclidean frames
inferred← citeshttps://doi.org/10.1109/tec.1959.5222698openalex-snapshot
Logical Machine Design II: A Selected Bibliography
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635671openalex-snapshot
Stability for pairs of equivalence relations.
inferred← citeshttps://doi.org/10.1305/ndjfl/1093635935openalex-snapshot
Classifying pairs of equivalence relations.
inferred← citeshttps://doi.org/10.2307/2270976openalex-snapshot
An undecidable two sorted predicate calculus
inferred← citeshttps://doi.org/10.2307/2271732openalex-snapshot
Elementary intuitionistic theories
inferred← citeshttps://doi.org/10.2307/2272464openalex-snapshot
Negative solution of the decision problem for sentences true in every subalgebra of 〈N, +〉
inferred← citeshttps://doi.org/10.2307/2272747openalex-snapshot
Decidability of some intuitionistic predicate theories
inferred← citeshttps://doi.org/10.2307/2272980openalex-snapshot
Sufficient conditions for the undecidability of intuitionistic theories with applications
inferred← citeshttps://doi.org/10.2307/2273360openalex-snapshot
Two-dimensional partial orderings: Undecidability
inferred← citeshttps://doi.org/10.2307/2275471openalex-snapshot
Indécidabilité de la théorie des paires immédiates de corps valués henseliens
inferred← citeshttps://doi.org/10.2307/2275703openalex-snapshot
Hereditary undecidability of some theories of finite structures
inferred← citeshttps://doi.org/10.2307/2322184openalex-snapshot
A Course in Universal Algebra.
inferred← citeshttps://doi.org/10.29007/bdbmopenalex-snapshot
Gödel logics and the fully boxed fragment of LTL
inferred← citeshttps://doi.org/10.3390/axioms14080623openalex-snapshot
On the Definability Problem of First-Order Sentences by Propositional Intuitionistic Formulas
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.