On the public citation graph

Epsilon-logic is more expressive than first-order logic over finite structures

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.
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.1006/inco.1996.0070openalex-snapshot
Logical Hierarchies in PTIME
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-62222-5_52openalex-snapshot
Expressive power of unary counters
inferredcites →https://doi.org/10.1007/bf01305232openalex-snapshot
An optimal lower bound on the number of variables for graph identification
inferredcites →https://doi.org/10.1007/bf01530924openalex-snapshot
Non-determinism in logic-based languages
inferredcites →https://doi.org/10.1016/s0898-1221(99)90035-4openalex-snapshot
Descriptive complexity
inferredcites →https://doi.org/10.1145/298514.298575openalex-snapshot
Non-deterministic languages to express deterministic transformations
inferredcites →https://doi.org/10.5860/choice.33-0359openalex-snapshot
Foundations of databases

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11538363_20openalex-snapshot
Towards a Characterization of Order-Invariant Queries over Tame Structures
inferred← citeshttps://doi.org/10.1007/11672142_23openalex-snapshot
Invariants of Automatic Presentations and Semi-synchronous Transductions
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_29openalex-snapshot
Logical Characterizations of PSPACE
inferred← citeshttps://doi.org/10.1007/978-3-642-32621-9_6openalex-snapshot
On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates
inferred← citeshttps://doi.org/10.1007/978-3-642-38536-0_10openalex-snapshot
A Short Tutorial on Order-Invariant First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_5openalex-snapshot
Ordered Structures
inferred← citeshttps://doi.org/10.1007/978-3-662-54069-5_4openalex-snapshot
Semantics and Proof Theory of the Epsilon Calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00152-9openalex-snapshot
Lower bounds for invariant queries in logics with counting
inferred← citeshttps://doi.org/10.1093/jigpal/jzt002openalex-snapshot
Epsilon-invariant substitutions and indefinite descriptions
inferred← citeshttps://doi.org/10.1109/lics.2001.932493openalex-snapshot
On definability of order in logic with choice
inferred← citeshttps://doi.org/10.1109/lics.2003.1210054openalex-snapshot
Successor-invariance in the finite
inferred← citeshttps://doi.org/10.1109/lics.2017.8005115openalex-snapshot
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion
inferred← citeshttps://doi.org/10.1137/110856873openalex-snapshot
Locality from Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1145/1938551.1938575openalex-snapshot
On the optimal approximation of queries using tractable propositional languages
inferred← citeshttps://doi.org/10.1145/3360011openalex-snapshot
Model-Checking on Ordered Structures
inferred← citeshttps://doi.org/10.2168/lmcs-12(1:9)2016openalex-snapshot
Order-Invariant Types and Their Applications
inferred← citeshttps://doi.org/10.2307/2586700openalex-snapshot
The Logic of Choice
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2008.1353openalex-snapshot
Order-Invariant MSO is Stronger than Counting MSO in the Finite
inferred← citeshttps://doi.org/10.70675/7174a6daz5394z4312zbdfbz396e68da3095openalex-snapshot
On the expressive power of invariant logics over sparse classes of structures
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.