On the public citation graph
Spectra with only unary function symbols
0 signed · 27 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.1002/malq.19550010403openalex-snapshot
Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität
inferredcites →https://doi.org/10.1006/inco.1995.1100openalex-snapshot
On Monadic NP vs Monadic co-NP
inferredcites →https://doi.org/10.1007/bf01699468openalex-snapshot
Universal quantifiers and time complexity of random access machines
inferredcites →https://doi.org/10.1007/bf01786976openalex-snapshot
Complexity classes and theories of finite models
inferredcites →https://doi.org/10.1016/0022-0000(90)90009-aopenalex-snapshot
First-order spectra with one variable
inferredcites →https://doi.org/10.1016/0304-3975(93)90218-iopenalex-snapshot
Finite-model theory - a personal perspective
inferredcites →https://doi.org/10.1016/0304-3975(95)00112-3openalex-snapshot
First-order spectra with one binary predicate
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1016/s0020-0190(96)00198-6openalex-snapshot
One unary function says less than two in existential second order logic
inferredcites →https://doi.org/10.2307/2266243openalex-snapshot
Y. Bar-Hillel. Bolzano's definition of analytic propositions. Methodos, Bd. 2 Heft 5 (1950), S. 32–55; zugleich Theoria, Bd. 16 (1950), S. 91–117.
inferredcites →https://doi.org/10.2307/2272354openalex-snapshot
Turing machines and the spectra of first-order formulas
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.200510010openalex-snapshot
The ultra-weak Ash conjecture and some particular cases
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/10703163_2openalex-snapshot
Descriptive Complexity, Lower Bounds and Linear Time
inferred← citeshttps://doi.org/10.1007/11874683_22openalex-snapshot
First-Order Queries over One Unary Function
inferred← citeshttps://doi.org/10.1007/978-94-007-0714-6_10openalex-snapshot
Generalizing Parikh’s Theorem
inferred← citeshttps://doi.org/10.1090/conm/558/11048openalex-snapshot
Spectra and systems of equations
inferred← citeshttps://doi.org/10.1109/lics.2003.1210068openalex-snapshot
Spectrum hierarchies and subdiagonal functions
inferred← citeshttps://doi.org/10.1109/lics.2003.1210069openalex-snapshot
Spectra of monadic second-order formulas with one unary function
inferred← citeshttps://doi.org/10.1137/130943625openalex-snapshot
Regular Graphs and the Spectra of Two-Variable Logic with Counting
inferred← citeshttps://doi.org/10.2178/bsl.1804020openalex-snapshot
Fifty years of the spectrum problem: survey and new results
inferred← citeshttps://doi.org/10.2178/jsl/1096901758openalex-snapshot
On spectra of sentences of monadic second order logic with counting
inferred← citeshttps://doi.org/10.2178/jsl/1203350786openalex-snapshot
Relational structures constructible by quantifier free definable operations
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:6)2017openalex-snapshot
Bounded degree and planar spectra
inferred← citeshttps://doi.org/10.3233/978-1-58603-782-6-261openalex-snapshot
Encounters with A. Mostowski
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.