On the public citation graph

The theory of successor with an extra predicate

https://doi.org/10.1007/bf01351676
0 signed · 31 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.1007/978-1-4613-8928-6_26openalex-snapshot
Definability in the Monadic Second-Order Theory of Successor
inferredcites →https://doi.org/10.1007/978-3-658-01628-9_10openalex-snapshot
Automatentheorie und formale Sprachen
inferredcites →https://doi.org/10.1007/978-3-663-10229-8_8openalex-snapshot
Automatentheorie und formale Sprachen
inferredcites →https://doi.org/10.1007/bf02280812openalex-snapshot
A note on undecidable extensions of monadic second order successor arithmetic
inferredcites →https://doi.org/10.1007/bfb0079423openalex-snapshot
First-order logic and its extensions
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50020-4openalex-snapshot
MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2269808openalex-snapshot
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
inferredcites →https://doi.org/10.2307/2271090openalex-snapshot
Definability in the monadic second-order theory of successor
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.3139openalex-snapshot
The Monadic Theory of Morphic Infinite Words and Generalizations
inferred← citeshttps://doi.org/10.1007/11874683_37openalex-snapshot
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_23openalex-snapshot
The Monadic Theory of Morphic Infinite Words and Generalizations
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_154openalex-snapshot
On logics, tilings, and automata
inferred← citeshttps://doi.org/10.1007/3-540-63246-8_8openalex-snapshot
Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_17openalex-snapshot
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_30openalex-snapshot
On Monadic Theories of Monadic Predicates
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_52openalex-snapshot
The Lower Reaches of Circuit Uniformity
inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_5openalex-snapshot
Logics for Regular Languages, Finite Monoids, and Circuit Complexity
inferred← citeshttps://doi.org/10.1007/bf01979864openalex-snapshot
Construction of decidable singular theories of two successor functions with an extra predicate
inferred← citeshttps://doi.org/10.1007/bfb0035752openalex-snapshot
Factors of words
inferred← citeshttps://doi.org/10.1007/pl00012449openalex-snapshot
Distributive lattices with a decidable monadic second order theory
inferred← citeshttps://doi.org/10.1016/0022-0000(82)90016-2openalex-snapshot
Classifying regular events in symbolic logic
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90663-xopenalex-snapshot
A combinatorial approach to the theory of ω-automata
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.1051/ita:2007044openalex-snapshot
Weakly maximal decidable structures
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.1145/193820.993132openalex-snapshot
BOOK REVIEW: Finite Automata, Formal Logic, and Circuit Complexity. By Howard Straubing. (Birkhauser. 1994. xii+226pp. ISBN 0-8176-3719-2. $39.50.)
inferred← citeshttps://doi.org/10.2307/2275227openalex-snapshot
Decidability and undecidability of theories with a predicate for the primes
inferred← citeshttps://doi.org/10.3233/fi-2018-1667openalex-snapshot
Shelah-Stupp’s Iteration and Muchnik’s Iteration
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.