On the public citation graph
Mechanizing set theory
0 signed · 71 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/3-540-58156-1_11openalex-snapshot
A fixedpoint approach to implementing (Co)inductive definitions
inferredcites →https://doi.org/10.1007/bf00263446openalex-snapshot
A mechanical proof of Quadratic Reciprocity
inferredcites →https://doi.org/10.1007/bf00263451openalex-snapshot
Automated deduction in von Neumann-Bernays-G�del set theory
inferredcites →https://doi.org/10.1007/bf00881863openalex-snapshot
Experimenting with Isabelle in ZF set theory
inferredcites →https://doi.org/10.1007/bf00881873openalex-snapshot
Set theory for verification: I. From foundations to functions
inferredcites →https://doi.org/10.1007/bf00881906openalex-snapshot
IMPS: An interactive mathematical proof system
inferredcites →https://doi.org/10.1007/bf00881916openalex-snapshot
Set theory for verification. II: Induction and recursion
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/0747-7171(92)90011-ropenalex-snapshot
Unification under a mixed prefix
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7010-7openalex-snapshot
Selected Papers on Automath
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7037-5openalex-snapshot
Set Theory An Introduction to Independence Proofs
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7094-6openalex-snapshot
Equivalents of the Axiom of Choice
inferredcites →https://doi.org/10.1016/s0747-7171(86)80002-5openalex-snapshot
Constructing recursion operators in intuitionistic type theory
inferredcites →https://doi.org/10.1017/cbo9780511569883openalex-snapshot
Metamathematics, Machines and Gödel's Proof
inferredcites →https://doi.org/10.1017/s0956796800001106openalex-snapshot
Residual theory in λ-calculus: a formal development
inferredcites →https://doi.org/10.17863/cam.23640openalex-snapshot
ISABELLE - THE NEXT 700 THEOREM PROVERS
inferredcites →https://doi.org/10.2307/2274372openalex-snapshot
Herman Rubin and Jean E. Rubin. Equivalents of the axiom of choice, II. Studies in logic and the foundations of mathematics, vol. 116. North-Holland, Amsterdam, New York, and Oxford, 1985, xxviii + 322 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_11openalex-snapshot
System Description: TPS: A Theorem Proving System for Type Theory
inferred← citeshttps://doi.org/10.1007/10721959_9openalex-snapshot
Gödel’s Algorithm for Class Formation
inferred← citeshttps://doi.org/10.1007/11814771_3openalex-snapshot
Representing and Reasoning with Operational Semantics
inferred← citeshttps://doi.org/10.1007/3-540-36469-2_14openalex-snapshot
A Theoretical Analysis of Hierarchical Proofs
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_14openalex-snapshot
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_31openalex-snapshot
The Reflection Theorem: A Study in Meta-theoretic Reasoning
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_19openalex-snapshot
“Higher-Order” Mathematics in B
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-60275-5_55openalex-snapshot
Experiments with ZF set theory in HOL and Isabelle
inferred← citeshttps://doi.org/10.1007/978-3-030-51054-1_13openalex-snapshot
Formalization of Forcing in Isabelle/ZF
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-032-32592-1_1openalex-snapshot
Free Set Theory – Cut Elimination and Consistency
inferred← citeshttps://doi.org/10.1007/978-3-319-08970-6_8openalex-snapshot
Cardinals in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-319-97879-6_6openalex-snapshot
Reasoning on Relations, Modalities, and Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_52openalex-snapshot
The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_25openalex-snapshot
Tool Support for Logics of Programs
inferred← citeshttps://doi.org/10.1007/bf00962280openalex-snapshot
An overview of cooperative answering
inferred← citeshttps://doi.org/10.1007/bfb0105405openalex-snapshot
Set theory, higher order logic or both?
inferred← citeshttps://doi.org/10.1007/s00165-004-0053-6openalex-snapshot
Mechanizing compositional reasoning for concurrent systems: some lessons
inferred← citeshttps://doi.org/10.1007/s10817-005-9023-9openalex-snapshot
Ordinal Arithmetic: Algorithms and Mechanization
inferred← citeshttps://doi.org/10.1007/s10817-006-9038-xopenalex-snapshot
Explaining Gabriel–Zisman Localization to the Computer
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/j.apal.2024.103413openalex-snapshot
The formal verification of the ctm approach to forcing
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.008openalex-snapshot
First Steps Towards a Formalization of Forcing
inferred← citeshttps://doi.org/10.1016/j.intcom.2007.09.001openalex-snapshot
A language-driven approach for the design of interactive applications
inferred← citeshttps://doi.org/10.1016/j.scico.2006.07.003openalex-snapshot
A documental approach to adventure game development
inferred← citeshttps://doi.org/10.1016/s0747-7171(03)00023-3openalex-snapshot
Computer proofs about finite and regular sets: the unifying concept of subvariance
inferred← citeshttps://doi.org/10.1023/a:1006269330992openalex-snapshot
A Formal Proof of Sylow's Theorem
inferred← citeshttps://doi.org/10.1023/a:1021966832558openalex-snapshot
A Compendium of Continuous Lattices in MIZAR
inferred← citeshttps://doi.org/10.1023/a:1022963714083openalex-snapshot
On Dynamically Presenting a Topology Course
inferred← citeshttps://doi.org/10.1093/jigpal/9.3.475openalex-snapshot
A simple formalization and proof for the mutilated chess board
inferred← citeshttps://doi.org/10.1098/rspa.2017.0872openalex-snapshot
Computational logic: its origins and applications
inferred← citeshttps://doi.org/10.1112/s1461157000000267openalex-snapshot
Mechanizing Nonstandard Real Analysis
inferred← citeshttps://doi.org/10.1112/s1461157000000449openalex-snapshot
The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf
inferred← citeshttps://doi.org/10.1142/9789812799661_0014openalex-snapshot
AN INDUCTIVE APPROACH TO FORMALIZING NOTIONS OF NUMBER THEORY PROOFS
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1145/1131313.1131317openalex-snapshot
Decidability results for sets with atoms
inferred← citeshttps://doi.org/10.1145/3372885.3373826openalex-snapshot
A formal proof of the independence of the continuum hypothesis
inferred← citeshttps://doi.org/10.1145/3437992.3439932openalex-snapshot
The generalised continuum hypothesis implies the axiom of choice in Coq
inferred← citeshttps://doi.org/10.1145/504709.504711openalex-snapshot
Mechanizing a theory of program composition for UNITY
inferred← citeshttps://doi.org/10.1609/aimag.v20i1.1442openalex-snapshot
Automated Deduction: Looking Ahead
inferred← citeshttps://doi.org/10.17863/cam.23736openalex-snapshot
Computational logic: its origins and applications.
inferred← citeshttps://doi.org/10.3217/jucs-005-03-0073openalex-snapshot
A Generic Tableau Prover and its Integration with Isabelle
inferred← citeshttps://doi.org/10.4230/lipics.itp.2025.26openalex-snapshot
Improving the SMT Proof Reconstruction Pipeline in Isabelle/HOL
inferred← citeshttps://doi.org/10.48456/tr-452openalex-snapshot
A formal proof of Sylow’s theorem An experiment in abstract algebra with Isabelle HOL
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9711106openalex-snapshot
Generic Automatic Proof Tools
inferred← citeshttps://doi.org/10.7146/brics.v2i37.19940openalex-snapshot
Experiments with ZF Set Theory in HOL and Isabelle
inferred← citeshttps://doi.org/10.7551/mitpress/5641.003.0013openalex-snapshot
A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions
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.