On the public citation graph

A note on undecidable extensions of monadic second order successor arithmetic

https://doi.org/10.1007/bf02280812
0 signed · 24 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.1002/malq.19710170143openalex-snapshot
Undecidable Extensions of Monadic Second Order Successor Arithmetic
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0093479-4openalex-snapshot
Restricted Set-Theoretical Definitions in Arithmetic
inferredcites →https://doi.org/10.2307/2269808openalex-snapshot
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor

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.19780240109openalex-snapshot
Über Unentscheidbare Erweiterungen von SC
inferred← citeshttps://doi.org/10.1002/malq.201500070openalex-snapshot
Spectra and satisfiability for logics with successor and a unary function
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_175openalex-snapshot
Joining k- and l-recognizable sets of natural numbers
inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_19openalex-snapshot
Composition Over the Natural Number Ordering with an Extra Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_5openalex-snapshot
Decidable Expansions of Labelled Linear Orderings
inferred← citeshttps://doi.org/10.1007/bf01351676openalex-snapshot
The theory of successor with an extra predicate
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-006-0031-1openalex-snapshot
Computational complexity of logical theories of one successor and another unary function
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90256-fopenalex-snapshot
The theory of 〈N, +, Vk, Vl〉 is undecidable
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.1070/im1984v022n03abeh001456openalex-snapshot
LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
inferred← citeshttps://doi.org/10.1070/rm1978v033n02abeh002304openalex-snapshot
DECIDABILITY PROBLEMS OF EXTENDED THEORIES
inferred← citeshttps://doi.org/10.1080/00927872.2015.1028236openalex-snapshot
Defining Multiplication in Some Additive Expansions of Polynomial Rings
inferred← citeshttps://doi.org/10.1137/22m1538065openalex-snapshot
A Strong Version of Cobham’s Theorem
inferred← citeshttps://doi.org/10.1145/3373718.3394779openalex-snapshot
Extensions of ω-Regular Languages
inferred← citeshttps://doi.org/10.1145/3519935.3519958openalex-snapshot
A strong version of Cobham’s theorem
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:5)2011openalex-snapshot
Decidable Expansions of Labelled Linear Orderings
inferred← citeshttps://doi.org/10.2307/2273193openalex-snapshot
On the bounded monadic theory of well-ordered structures
inferred← citeshttps://doi.org/10.2307/2275643openalex-snapshot
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
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.48550/arxiv.1701.08426openalex-snapshot
Definability and decidability in expansions by generalized Cantor sets
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.