On the public citation graph
Intersecting sets in midset spaces. I
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.1006/jmaa.1993.1323openalex-snapshot
Intersection Theorems and Minimax Theorems Based on Connectedness
inferredcites →https://doi.org/10.1007/978-3-642-67678-9openalex-snapshot
A Compendium of Continuous Lattices
inferredcites →https://doi.org/10.1007/bf01191693openalex-snapshot
On a minimax theorem of Terkelsen's
inferredcites →https://doi.org/10.1007/bf01199015openalex-snapshot
A general minimax theorem based on connectedness
inferredcites →https://doi.org/10.1007/bf01897316openalex-snapshot
Minimax theorems for upper semicontinuous functions
inferredcites →https://doi.org/10.1007/bf01950707openalex-snapshot
Minimax theorems for interval spaces
inferredcites →https://doi.org/10.1016/0012-365x(81)90206-5openalex-snapshot
Metrics on partially ordered sets—A survey
inferredcites →https://doi.org/10.1016/0095-8956(88)90039-1openalex-snapshot
Convex sets in graphs, II. Minimal path convexity
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08864-9openalex-snapshot
A ternary operation in distributive lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1993-1127141-4openalex-snapshot
Topological Intersection Theorems
inferredcites →https://doi.org/10.1112/jlms/s2-3.3.422openalex-snapshot
Some Elementary Properties of Interval Convexities
inferredcites →https://doi.org/10.1112/plms/s3-48.1.1openalex-snapshot
Binary Convexities and Distributive Lattices
inferredcites →https://doi.org/10.1155/s0161171290000965openalex-snapshot
Order‐theoretical connectivity
inferredcites →https://doi.org/10.2140/pjm.1974.51.363openalex-snapshot
Helly and Radon-type theorems in interval convexity spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5328openalex-snapshot
Topological Minimax Theorems and Approximation
inferred← citeshttps://doi.org/10.1006/jmaa.1998.6042openalex-snapshot
Two-Function Topological Minimax Theorems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_1openalex-snapshot
Minimax Theorems and Their Proofs
inferred← citeshttps://doi.org/10.1007/bf00052107openalex-snapshot
Extensions of Ky Fan section theorems and minimax inequality theorems
inferred← citeshttps://doi.org/10.1007/bf00058948openalex-snapshot
Topological intersection theorems of set-valued mappings without closed graphs and their applications
inferred← citeshttps://doi.org/10.1007/bf01198671openalex-snapshot
Intersecting sets in midset spaces. II
inferred← citeshttps://doi.org/10.1023/a:1022679504350openalex-snapshot
New Saddle Point Theorem Beyond Topological Vector Spaces
inferred← citeshttps://doi.org/10.1080/01630569608816703openalex-snapshot
Topological intersection theorems for two set—valued mappings and applications to minimax inequalities
inferred← citeshttps://doi.org/10.68381/jca14034openalex-snapshot
Abstract Convexity and Connectedness
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.