On the public citation graph

Set theory, higher order logic or both?

https://doi.org/10.1007/bfb0105405
0 signed · 40 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/0-387-97226-9_37openalex-snapshot
Veritas+: A specification language based on type theory
inferredcites →https://doi.org/10.1007/3-540-58085-9_78openalex-snapshot
The Alf proof editor and its proof engine
inferredcites →https://doi.org/10.1007/3-540-58156-1_43openalex-snapshot
Exploring abstract algebra in constructive type theory
inferredcites →https://doi.org/10.1007/3-540-58468-4_159openalex-snapshot
Specifying and verifying fault-tolerant systems
inferredcites →https://doi.org/10.1007/3-540-60275-5_55openalex-snapshot
Experiments with ZF set theory in HOL and Isabelle
inferredcites →https://doi.org/10.1007/bf00283132openalex-snapshot
Mechanizing set theory
inferredcites →https://doi.org/10.1007/bf00881906openalex-snapshot
IMPS: An interactive mathematical proof system
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1145/1012497.1012511openalex-snapshot
The enhanced HDM system for specification and verification
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.48456/tr-353openalex-snapshot
Merging HOL with set theory
inferredcites →https://doi.org/10.48456/tr-354openalex-snapshot
Formalising a model of the λ-calculus in HOL-ST
inferredcites →https://doi.org/10.7146/brics.v2i37.19940openalex-snapshot
Experiments with ZF Set Theory in HOL and Isabelle

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11814771_19openalex-snapshot
Combining Type Theory and Untyped Set Theory
inferred← citeshttps://doi.org/10.1007/11921240_19openalex-snapshot
Partizan Games in Isabelle/HOLZF
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_22openalex-snapshot
Finite Set Theory in ACL2
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_2openalex-snapshot
Disjoint Sums over Type Classes in HOL
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_4openalex-snapshot
Isomorphisms — A Link Between the Shallow and the Deep
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_18openalex-snapshot
Partial Functions in an Impredicative Simple Theory of Types
inferred← citeshttps://doi.org/10.1007/978-3-030-23250-4_4openalex-snapshot
A Tale of Two Set Theories
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_6openalex-snapshot
Wetzel: Formalisation of an Undecidable Problem Linked to the Continuum Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_7openalex-snapshot
The Naproche-ZF Theorem Prover (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_1openalex-snapshot
Hammering Higher Order Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-20615-8_6openalex-snapshot
Type Inference for ZFH
inferred← citeshttps://doi.org/10.1007/978-3-319-52228-9_8openalex-snapshot
An Axiomatic Value Model for Isabelle/UTP
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_31openalex-snapshot
A Calculus for Set-Based Program Development
inferred← citeshttps://doi.org/10.1007/978-3-642-14052-5_23openalex-snapshot
A Mechanized Translation from Higher-Order Logic to Set Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-24276-2_6openalex-snapshot
From Bayesian Notation to Pure Racket via Discrete Measure-Theoretic Probability in λ ZFC
inferred← citeshttps://doi.org/10.1007/bfb0028402openalex-snapshot
Type classes and overloading in higher-order logic
inferred← citeshttps://doi.org/10.1007/s10817-023-09663-5openalex-snapshot
Combining Higher-Order Logic with Set Theory Formalizations
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50017-5openalex-snapshot
Classical Type Theory
inferred← citeshttps://doi.org/10.1023/a:1006437704595openalex-snapshot
STMM: A Set Theory for Mechanized Mathematics
inferred← citeshttps://doi.org/10.1023/a:1026744827863openalex-snapshot
A Set Theory with Support for Partial Functions
inferred← citeshttps://doi.org/10.1109/lics.2007.7openalex-snapshot
A Dependent Set Theory
inferred← citeshttps://doi.org/10.1109/sefm.2004.1347536openalex-snapshot
Automated element-wise reasoning with sets
inferred← citeshttps://doi.org/10.1109/sefm.2004.8openalex-snapshot
Automated element-wise reasoning with sets
inferred← citeshttps://doi.org/10.1145/1131313.1131317openalex-snapshot
Decidability results for sets with atoms
inferred← citeshttps://doi.org/10.48550/arxiv.1201.0540openalex-snapshot
ProofPeer - A Cloud-based Interactive Theorem Proving System
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05970openalex-snapshot
HolPy: Interactive Theorem Proving in Python
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1710openalex-snapshot
Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure
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.