On the public citation graph
Undecidable fragments of elementary theories
0 signed · 57 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.1007/978-1-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-662-02460-7openalex-snapshot
Recursively Enumerable Sets and Degrees
inferredcites →https://doi.org/10.1007/bf02218612openalex-snapshot
Recursively enumerable many-one degrees
inferredcites →https://doi.org/10.1007/bf02485250openalex-snapshot
Lattice-theoretic decision problems in universal algebra
inferredcites →https://doi.org/10.1016/0168-0072(93)90206-sopenalex-snapshot
Undecidability and 1-types in the recursively enumerable degrees
inferredcites →https://doi.org/10.1016/s0049-237x(99)x8037-2openalex-snapshot
Classical Recursion Theory
inferredcites →https://doi.org/10.1090/memo/0246openalex-snapshot
Decidability and Boolean representations
inferredcites →https://doi.org/10.1090/s0002-9904-1978-14552-2openalex-snapshot
Recursively enumerable sets and degrees
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0542080-8openalex-snapshot
Finitely Presented Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0227009-1openalex-snapshot
On the Lattice of Recursively Enumerable Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0576864-xopenalex-snapshot
Free Modular Lattices
inferredcites →https://doi.org/10.1215/s0012-7094-42-00942-6openalex-snapshot
Theory of equivalence relations
inferredcites →https://doi.org/10.2307/2271091openalex-snapshot
Finite inseparability of some theories of cylindrification algebras
inferredcites →https://doi.org/10.2307/2274468openalex-snapshot
Undecidability and initial segments of the (r.e.) tt-degrees
inferredcites →https://doi.org/10.2307/2275213openalex-snapshot
Definability of models by means of existential formulas without identity
inferredcites →https://doi.org/10.4153/cjm-1970-010-6openalex-snapshot
Initial Segments of Many-One Degrees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-03073-4_33openalex-snapshot
The First Order Theories of the Medvedev and Muchnik Lattices
inferred← citeshttps://doi.org/10.1007/s00153-004-0219-1openalex-snapshot
The isomorphism problem for classes of computable fields
inferred← citeshttps://doi.org/10.1007/s00153-018-0647-yopenalex-snapshot
Elementary theories and hereditary undecidability for semilattices of numberings
inferred← citeshttps://doi.org/10.1007/s10469-012-9161-1openalex-snapshot
Computably enumerable sets and related issues
inferred← citeshttps://doi.org/10.1007/s10469-015-9333-xopenalex-snapshot
Preserving Categoricity and Complexity of Relations
inferred← citeshttps://doi.org/10.1007/s10958-014-2154-yopenalex-snapshot
Complexity of Isomorphism Problem for Computable Projective Planes
inferred← citeshttps://doi.org/10.1007/s10958-023-06656-yopenalex-snapshot
Classes of Algebraic Structures
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107686openalex-snapshot
Fragments of the theory of the enumeration degrees
inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103821openalex-snapshot
On computability-theoretic universality of Boolean-valued models
inferred← citeshttps://doi.org/10.1017/jsl.2013.8openalex-snapshot
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
inferred← citeshttps://doi.org/10.1017/jsl.2019.91openalex-snapshot
CODING IN GRAPHS AND LINEAR ORDERINGS
inferred← citeshttps://doi.org/10.1017/s0960129516000189openalex-snapshot
Quantifying over events in probability logic: an introduction
inferred← citeshttps://doi.org/10.1023/b:allo.0000048827.30718.2copenalex-snapshot
Comparing Classes of Finite Structures
inferred← citeshttps://doi.org/10.1090/s0002-9947-98-01800-5openalex-snapshot
The Π₃-theory of the computably enumerable Turing degrees is undecidable
inferred← citeshttps://doi.org/10.1093/jigpal/jzae042openalex-snapshot
An ‘elementary’ perspective on reasoning about probability spaces
inferred← citeshttps://doi.org/10.1093/logcom/exs041openalex-snapshot
Complexity for probability logic with quantifiers over propositions
inferred← citeshttps://doi.org/10.1093/logcom/exu066openalex-snapshot
A note on hereditarily Π10- and Σ10-complete sets of sentences
inferred← citeshttps://doi.org/10.1112/s002461159800046xopenalex-snapshot
Interpretability and Definability in the Recursively Enumerable Degrees
inferred← citeshttps://doi.org/10.1134/s0001434625603466openalex-snapshot
On Hereditarily Undecidable Fragments of Basic Elementary Theories
inferred← citeshttps://doi.org/10.1134/s0037446618020131openalex-snapshot
Complexity of the Isomorphism Problem for Computable Free Projective Planes of Finite Rank
inferred← citeshttps://doi.org/10.1134/s1064562422700053openalex-snapshot
Computational Complexity of Theories of a Binary Predicate with a Small Number of Variables
inferred← citeshttps://doi.org/10.1142/s0218196703001286openalex-snapshot
Separating Classes of Groups by First-Order Sentences
inferred← citeshttps://doi.org/10.21146/2074-1472-2023-29-1-114-146openalex-snapshot
Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино?
inferred← citeshttps://doi.org/10.2178/jsl/1107298523openalex-snapshot
The isomorphism problem for computable Abelian p-groups of bounded length
inferred← citeshttps://doi.org/10.2178/jsl/1164060455openalex-snapshot
The Π3-theory of the -enumeration degrees is undecidable
inferred← citeshttps://doi.org/10.2178/jsl/1268917493openalex-snapshot
Interpreting true arithmetic in the -enumeration degrees
inferred← citeshttps://doi.org/10.2178/jsl/1309952523openalex-snapshot
Classes of Ulm type and coding rank-homogeneous trees in other structures
inferred← citeshttps://doi.org/10.26456/vtpmk728openalex-snapshot
О теориях алгебр подмножеств и решёток подпространств в конечных линейных пространствах
inferred← citeshttps://doi.org/10.4213/im9652openalex-snapshot
On the decision problem for quantified probability logics
inferred← citeshttps://doi.org/10.4213/im9652eopenalex-snapshot
On the decision problem for quantified probability logics
inferred← citeshttps://doi.org/10.4213/mzm14531openalex-snapshot
О наследственно неразрешимых фрагментах базовых элементарных теорий
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6399openalex-snapshot
Coding Methods in Computability Theory and Complexity Theory
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.