On the public citation graph
Formalizing basic first order model theory
0 signed · 38 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/bf01383982openalex-snapshot
The HOL logic extended with quantification over type variables
inferredcites →https://doi.org/10.1016/0304-3975(82)90028-7openalex-snapshot
The theory of functional and template dependencies
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/b978-0-444-89880-7.50007-3openalex-snapshot
The HOL Logic Extended with Quantification over Type Variables
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1017/cbo9781139172066openalex-snapshot
Notes on Logic and Set Theory
inferredcites →https://doi.org/10.2307/2185879openalex-snapshot
Foundations without Foundationalism: A Case for Second-Order Logic.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11541868_16openalex-snapshot
Essential Incompleteness of Arithmetic Verified by Coq
inferred← citeshttps://doi.org/10.1007/11541868_19openalex-snapshot
A Mechanically Verified, Sound and Complete Theorem Prover for First Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_30openalex-snapshot
Mechanised Modal Model Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-91550-6_9openalex-snapshot
Using Isabelle in Two Courses on Logic and Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_7openalex-snapshot
Hall’s Theorem for Enumerable Families of Finite Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_5openalex-snapshot
Machine-Checked Compositional Specification and Proofs for Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_4openalex-snapshot
Unified Classical Logic Completeness
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-40229-1_4openalex-snapshot
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
inferred← citeshttps://doi.org/10.1007/978-3-319-43144-4_21openalex-snapshot
Formalization of the Resolution Calculus for First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-74591-4_11openalex-snapshot
A Formally Verified Prover for the $\mathcal{ALC\,}$ Description Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-22863-6_20openalex-snapshot
A Verified Runtime for a Verified Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_17openalex-snapshot
Mechanizing the Metatheory of Sledgehammer
inferred← citeshttps://doi.org/10.1007/bfb0055125openalex-snapshot
Theorem Proving in Higher Order Logics
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-016-9391-3openalex-snapshot
Soundness and Completeness Proofs by Coinductive Methods
inferred← citeshttps://doi.org/10.1007/s10817-017-9447-zopenalex-snapshot
Formalization of the Resolution Calculus for First-Order Logic
inferred← citeshttps://doi.org/10.1007/s10817-018-9455-7openalex-snapshot
A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
inferred← citeshttps://doi.org/10.1023/a:1006242018697openalex-snapshot
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1109/ispras51486.2020.00011openalex-snapshot
Formally verified complete quantifier instatiation strategy for the theory of bounded linear integer arithmetic
inferred← citeshttps://doi.org/10.1145/3167099openalex-snapshot
A constructive formalisation of Semi-algebraic sets and functions
inferred← citeshttps://doi.org/10.1145/3176245.3167099openalex-snapshot
A constructive formalisation of Semi-algebraic sets and functions
inferred← citeshttps://doi.org/10.1145/3293880.3294087openalex-snapshot
Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)
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/3703595.3705882openalex-snapshot
An Isabelle/HOL Framework for Synthetic Completeness Proofs
inferred← citeshttps://doi.org/10.4204/eptcs.267.9openalex-snapshot
Natural Deduction and the Isabelle Proof Assistant
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0505034openalex-snapshot
Essential Incompleteness of Arithmetic Verified by Coq
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/1974openalex-snapshot
Basic first-order model theory in Mizar
inferred← citeshttps://doi.org/10.70675/03483742z8bd7z446azb7f3z4dc66e5f20b9openalex-snapshot
Formalisations en Coq pour la décision de problèmes en géométrie algébrique réelle
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.