Proofs Without Nominals: G"odel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes
cs.LO, cs.AI, math.LO
Submitted: 2026-09-28
Updated: 2026-10-13
Related papers
- An Information-Flow Perspective on Explainability Requirements: Specification and Verification
- A programming language combining quantum and classical control
- Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
- Encoder-Decoder Transformers: Logical Characterizations and Periodicity
- Ultraconstructive Model Theory via Bounded Adversarial Finite Structures