On the public citation graph

Towards mechanical metamathematics

https://doi.org/10.1007/bf00244278
0 signed · 35 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.1016/0004-3702(80)90015-6openalex-snapshot
Prolegomena to a theory of mechanized formal reasoning
inferredcites →https://doi.org/10.1016/0004-3702(80)90049-1openalex-snapshot
An investigation into the goals of research in automatic theorem proving as related to mathematical reasoning
inferredcites →https://doi.org/10.1016/0898-1221(79)90044-0openalex-snapshot
Metamathematical extensibility for theorem verifiers and proof-checkers

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-16780-3_133openalex-snapshot
Overview of a theorem-prover for a computational logic
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_29openalex-snapshot
Formal Verification of a Combination Decision Procedure
inferred← citeshttps://doi.org/10.1007/3-540-48754-9_11openalex-snapshot
Intuitionisitic Tableau Extracted
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_75openalex-snapshot
A theorem prover for a computational logic
inferred← citeshttps://doi.org/10.1007/3-540-56320-2_55openalex-snapshot
Formal theories and software systems: Fundamental connections between Computer Science and Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-86887-1_5openalex-snapshot
A Case Study in Computer-Assisted Meta-reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-21743-2_31openalex-snapshot
On Verified Automated Reasoning in Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-50628-4_5openalex-snapshot
Formalizing Henkin-Style Completeness of an Axiomatic System for Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-94205-6_7openalex-snapshot
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
inferred← citeshttps://doi.org/10.1007/978-3-540-30142-4_8openalex-snapshot
A Mechanical Proof of the Cook-Levin Theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_3openalex-snapshot
Trust and Automation in Verification Tools
inferred← citeshttps://doi.org/10.1007/978-3-642-74884-4_4openalex-snapshot
The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_6openalex-snapshot
Metalevel Programming in Constructive Type Theory
inferred← citeshttps://doi.org/10.1007/bf00244488openalex-snapshot
Computer proofs in Group Theory
inferred← citeshttps://doi.org/10.1007/bf00249356openalex-snapshot
Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm
inferred← citeshttps://doi.org/10.1007/bfb0012825openalex-snapshot
An environment for automated reasoning about partial functions
inferred← citeshttps://doi.org/10.1007/bfb0016237openalex-snapshot
An approach to proof checker
inferred← citeshttps://doi.org/10.1007/bfb0055132openalex-snapshot
Classical propositional decidability via Nuprl proof extraction
inferred← citeshttps://doi.org/10.1007/s10817-013-9291-8openalex-snapshot
Formally Verified Tableau-Based Reasoners for a Description Logic
inferred← citeshttps://doi.org/10.1007/s10817-020-09561-0openalex-snapshot
Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover
inferred← citeshttps://doi.org/10.1007/s10817-023-09677-zopenalex-snapshot
Mechanising Gödel–Löb Provability Logic in HOL Light
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00215-7openalex-snapshot
The Boyer-Moore theorem prover and its interactive enhancement
inferred← citeshttps://doi.org/10.1016/b978-0-12-122952-8.50022-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.03.002openalex-snapshot
The Mechanical Verification of a DPLL-Based Satisfiability Solver
inferred← citeshttps://doi.org/10.1016/j.scico.2010.08.002openalex-snapshot
A mechanical verification of the stressing algorithm for negative cost cycle detection in networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.014openalex-snapshot
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70270-2openalex-snapshot
Finitary inductively presented logics
inferred← citeshttps://doi.org/10.1142/9789812813411_0048openalex-snapshot
Logical Basis for the Automation of Reasoning: Case Studies
inferred← citeshttps://doi.org/10.1142/s2196888824500064openalex-snapshot
On Verified Automated Reasoning in Propositional Logic: Teaching Sequent Calculus to Computer Science Students
inferred← citeshttps://doi.org/10.1145/44483.44484openalex-snapshot
A mechanical proof of the Church-Rosser theorem
inferred← citeshttps://doi.org/10.29007/pn71openalex-snapshot
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover
inferred← citeshttps://doi.org/10.4230/lipics.itp.2021.26openalex-snapshot
A Formal Proof of Modal Completeness for Provability Logic
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.