On the public citation graph

?-match: An inference rule for incrementally elaborating set instantiations

https://doi.org/10.1007/bf00881874
0 signed · 21 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.1007/10817.1573-0670openalex-snapshot
Journal of Automated Reasoning
inferredcites →https://doi.org/10.1007/3-540-55602-8_210openalex-snapshot
&: Automated natural deduction
inferredcites →https://doi.org/10.1007/bf00244943openalex-snapshot
A ?-unifiability test for set theory
inferredcites →https://doi.org/10.1007/bf00245023openalex-snapshot
The problem of finding an inference rule for set theory
inferredcites →https://doi.org/10.1016/0004-3702(75)90014-4openalex-snapshot
A relaxation approach to splitting in an automatic theorem prover
inferredcites →https://doi.org/10.1016/0004-3702(88)90030-6openalex-snapshot
Man-machine theorem proving in graph theory
inferredcites →https://doi.org/10.1016/s0004-3702(78)80017-4openalex-snapshot
Towards the automation of set theory and its logic
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321850.321858openalex-snapshot
A Human Oriented Logic for Automatic Theorem-Proving

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45620-1_33openalex-snapshot
Solving for Set Variables in Higher-Order Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-46508-1_12openalex-snapshot
An Equational Re-engineering of Set Theories
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_210openalex-snapshot
&: Automated natural deduction
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_120openalex-snapshot
Proof search with set variable instantiation in the Calculus of Constructions
inferred← citeshttps://doi.org/10.1007/bf00252180openalex-snapshot
TPS: A theorem-proving system for classical type theory
inferred← citeshttps://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferred← citeshttps://doi.org/10.1007/bfb0054272openalex-snapshot
Selectively instantiating definitions
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00175-9openalex-snapshot
The calculus of constructions as a framework for proof search with set variable instantiation
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00147-1openalex-snapshot
Layered map reasoning
inferred← citeshttps://doi.org/10.5281/zenodo.26327openalex-snapshot
Woitkowskia, A New Genus Of Army Ants.
inferred← citeshttps://doi.org/10.5555/1035053.1035061openalex-snapshot
Evaluating reasoning heuristics in the context of multi-level marketing 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.