arXiv AI
G\"odel's and Scott's Variants of the Ontological Argument in Lean 4 and TPTP THF
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Sep 24
G\"odel's and Scott's Variants of the Ontological Argument in Lean 4
This paper reports a full, structure‑preserving port of the Isabelle/HOL dataset on G"odel’s and Scott’s modal ontological arguments to Lean 4. The port consists of 30 Lean 4 modules that mirror the original theories in section structure, declaration order, and naming, and a comparison tool confirms that all 548 statements are identical. The Lean 4 development reproduces every proof from the Isabelle/HOL version—including the inconsistency of G"odel’s 1970 axioms, the repaired variants, Scott’s variant, modal collapse, monotheism, and the ultrafilter property—while also proving five previously unproven statements and documenting the remaining 45 as unresolved. "whyItMatters":"The work demonstrates that Lean 4 can faithfully replicate a complex formal development from Isabelle/HOL, providing a new, lean‑based foundation for further exploration of modal ontological arguments."
arXiv AI
4d ago
Proofs Without Nominals: G\"odel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes
arXiv:2609.36279v1 Announce Type: cross Abstract: The shallow embedding of higher-order modal logic in classical higher-order logic, used in Benzm\"uller and Scott's Notes on G\"odel's and Scott's va...
arXiv AI
Jul 21
AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language
arXiv:2607. 16372v1 Announce Type: cross Abstract: Interactive theorem proving (ITP) underpins program verification and formalized mathematics, but its manual effort limits scalability.
arXiv AI
Jun 30
LAMP: Lean-based Agentic framework with MCP and Proof Repair
arXiv:2606. 28841v1 Announce Type: cross Abstract: Large language models are increasingly capable of mathematical reasoning, but the proofs they generate are often unreliable and hard to verify.
arXiv AI
Jul 14
First-Order Modal Logic in HOL: Deep and Shallow Embeddings with Automated Faithfulness (Extended Preprint)
arXiv:2607. 10880v1 Announce Type: new Abstract: We extend, in Isabelle/HOL, the deep-and-shallow embedding methodology of our prior work from propositional to first-order modal logic (FML) with constant-domain Kripke semantics.
arXiv Machine Learning
Aug 7
Can Open-Weight LLMs Produce Kernel-Verified Coq Proofs? A Pilot Study
arXiv:2608. 05420v1 Announce Type: cross Abstract: Large language models (LLMs) can generate text that resembles a mathematical proof, but resemblance does not establish correctness.