On the public citation graph

Decidability and essential undecidability

0 signed · 65 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/bf01443610openalex-snapshot

Ueber die Verwerthung der elliptischen Functionen f�r die Geometrie der Curven dritten Grades

inferredcites →https://doi.org/10.1007/bf01448447openalex-snapshot

Beitr�ge zur Algebra der Logik, insbesondere zum Entscheidungsproblem

inferredcites →https://doi.org/10.2307/2268485openalex-snapshot

Solution of a problem of Tarski

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.19580040705openalex-snapshot

Undecidability and recursive inseparability

inferred← citeshttps://doi.org/10.1002/malq.19600060105openalex-snapshot

Weak Second‐Order Arithmetic and Finite Automata

inferred← citeshttps://doi.org/10.1002/malq.19600061502openalex-snapshot

Theories with Effectively Inseparable Nuclei

inferred← citeshttps://doi.org/10.1002/malq.19710170143openalex-snapshot

Undecidable Extensions of Monadic Second Order Successor Arithmetic

inferred← citeshttps://doi.org/10.1002/malq.19710170148openalex-snapshot

Rekursive Untrennbarkeit Bei Elementaren Theorien

inferred← citeshttps://doi.org/10.1007/3-540-45583-3_23openalex-snapshot

Refuting Learning Revisited

inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_22openalex-snapshot

Weak Second-Order Arithmetic and Finite Automata

inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot

On a Decision Method in Restricted Second Order Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-319-63046-5_6openalex-snapshot

On the Combination of the Bernays–Schönfinkel–Ramsey Fragment with Simple Linear Integer Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_14openalex-snapshot

The Bernays–Schönfinkel–Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable

inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_9openalex-snapshot

Logical Refinements of Church’s Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-00596-1_1openalex-snapshot

Facets of Synthesis: Revisiting Church’s Problem

inferred← citeshttps://doi.org/10.1007/bf01977245openalex-snapshot

Minimal- und Primmodelle

inferred← citeshttps://doi.org/10.1007/bfb0090984openalex-snapshot

Undecidability of extensions of the monadic first-order theory of successor and two-dimensional finite automata

inferred← citeshttps://doi.org/10.1007/s00153-013-0328-9openalex-snapshot

A note on definability in fragments of arithmetic with free unary predicates

inferred← citeshttps://doi.org/10.1007/s00153-024-00911-yopenalex-snapshot

Essential hereditary undecidability

inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot

Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates

inferred← citeshttps://doi.org/10.1007/s11856-016-1410-xopenalex-snapshot

Positive existential definability of multiplication from addition and the range of a polynomial

inferred← citeshttps://doi.org/10.1016/0022-0000(79)90033-3openalex-snapshot

Undecidability of the first-order arithmetic A[P(x), 2x, x + 1]

inferred← citeshttps://doi.org/10.1016/0304-3975(80)90042-0openalex-snapshot

The reachability problem for Petri nets and decision problems for Skolem arithmetic

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70025-9openalex-snapshot

Bibliography

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.1016/s0049-237x(09)70564-6openalex-snapshot

Symposium on Decision Problems: On a Decision Method in Restricted Second Order Arithmetic

inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70566-xopenalex-snapshot

On a Theorem of Cobham Concerning Undecidable Theories

inferred← citeshttps://doi.org/10.1016/s0076-5392(08)62337-1openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00113-4openalex-snapshot

A list of arithmetical structures complete with respect to the first-order definability

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00422-xopenalex-snapshot

Refuting learning revisited

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00814-9openalex-snapshot

Learning power and language expressiveness

inferred← citeshttps://doi.org/10.1070/im1988v030n01abeh000995openalex-snapshot

NONCONSTRUCTIVIZABLE FORMAL ARITHMETIC STRUCTURES

inferred← citeshttps://doi.org/10.1070/rm1978v033n02abeh002304openalex-snapshot

DECIDABILITY PROBLEMS OF EXTENDED THEORIES

inferred← citeshttps://doi.org/10.1070/rm2010v065n05abeh004703openalex-snapshot

Gödel incompleteness theorems and the limits of their applicability. I

inferred← citeshttps://doi.org/10.1070/sm1986v054n02abeh002971openalex-snapshot

PRIME VECTORS IN DEGENERATE LATTICES

inferred← citeshttps://doi.org/10.1090/s0002-9947-1961-0139530-9openalex-snapshot

Decision problems of finite automata design and related arithmetics

inferred← citeshttps://doi.org/10.1090/s0002-9947-1963-0153554-9openalex-snapshot

Creativity and Effective Inseparability

inferred← citeshttps://doi.org/10.1093/jigpal/jzad015openalex-snapshot

On the relationships between some meta-mathematical properties of arithmetical theories

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.001.0001openalex-snapshot

Recursion Theory for Metamathematics

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0001openalex-snapshot

Title Pages

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0002openalex-snapshot

Dedication

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.002.0003openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0004openalex-snapshot

Prerequisites

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0005openalex-snapshot

Recursive Enumerability and Recursivity

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0006openalex-snapshot

Undecidability and Recursive Inseparability

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0007openalex-snapshot

Indexing

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0008openalex-snapshot

Generative Sets and Creative Systems

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0009openalex-snapshot

Double Generativity and Complete Effective

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0010openalex-snapshot

Universal and Doubly Universal Systems

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0011openalex-snapshot

Shepherdson Revisited

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0012openalex-snapshot

Recursion Theorems

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0013openalex-snapshot

Symmetric and Double Recursion Theorems

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0014openalex-snapshot

Productivity and Double Productivity

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0015openalex-snapshot

Three Special Topics

inferred← citeshttps://doi.org/10.1093/oso/9780195082326.003.0016openalex-snapshot

Uniform Gödelization

inferred← citeshttps://doi.org/10.1109/tec.1959.5222698openalex-snapshot

Logical Machine Design II: A Selected Bibliography

inferred← citeshttps://doi.org/10.1145/321186.321196openalex-snapshot

Finite Automata and the Set of Squares

inferred← citeshttps://doi.org/10.22405/2226-8383-2021-22-1-27-56openalex-snapshot

70 year jubilee of academician Alexei L. Semenov

inferred← citeshttps://doi.org/10.2307/1993511openalex-snapshot

Decision Problems of Finite Automata Design and Related Arithmetics

inferred← citeshttps://doi.org/10.2307/2275227openalex-snapshot

Decidability and undecidability of theories with a predicate for the primes

inferred← citeshttps://doi.org/10.2307/2586837openalex-snapshot

Undecidable extensions of Skolem arithmetic

inferred← citeshttps://doi.org/10.2307/2964336openalex-snapshot

Sentences true in all constructive models

inferred← citeshttps://doi.org/10.4064/fm-156-2-111-129openalex-snapshot

Definability within structures related to Pascal’s triangle modulo an integer

inferred← citeshttps://doi.org/10.4213/rm9378openalex-snapshot

Теоремы Гeделя о неполноте и границы их применимости. I

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.