Types, tableaus, and Gödel's God

zbMath1038.03001MaRDI QIDQ1406610

Melvin Fitting

Publication date: 7 September 2003

Published in: Trends in Logic -- Studia Logica Library (Search for Journal in Brave)

zbMATH Keywords

modal logiccut eliminationHenkin semanticsclassical simple theory of typesGödel's ontological argumentmodal tableaux

Mathematics Subject Classification ID

Related Items (25)

Variants of Gödel's ontological proof in a natural deduction calculus ⋮ Interacting with Modal Logics in the Coq Proof Assistant ⋮ First-order intensional logic ⋮ Unnamed Item ⋮ SAT-Inspired Higher-Order Eliminations ⋮ Superposition for higher-order logic ⋮ Quantified multimodal logics in simple type theory ⋮ Higher-Order Modal Logics: Automation and Applications ⋮ Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument ⋮ Some weakened Gödelian ontological systems ⋮ Identity, equality, nameability and completeness. Part II ⋮ Completeness in hybrid type theory ⋮ Actualism, serious actualism, and quantified modal logic ⋮ Computer-assisted analysis of the Anderson-Hájek ontological controversy ⋮ Partly free semantics for some Anderson-like ontological proofs ⋮ Associative substitutional semantics and quantified modal logic ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ Superposition with lambdas ⋮ Ontological proofs of existence and non-existence ⋮ Superposition with lambdas ⋮ Superposition for full higher-order logic ⋮ All Properties are Divine or God Exists - The Sacred Thesis and its Ontological Argument ⋮ Semantic analysis of some variants of Anderson-like ontological proofs ⋮ Higher-Order Syntax and Saturation Algorithms for Hybrid Logic ⋮ THE DEVELOPMENT OF GÖDEL’S ONTOLOGICAL PROOF

This page was built for publication: Types, tableaus, and Gödel's God