Amanote Research

Amanote Research

    RegisterSign In

A Machine-Assisted Proof of Gödel’s Incompleteness Theorems for the Theory of Hereditarily Finite Sets

Review of Symbolic Logic - United Kingdom
doi 10.1017/s1755020314000112
Full Text
Open PDF
Abstract

Available in full text

Categories
MathematicsPhilosophyLogic
Date

April 3, 2014

Authors
LAWRENCE C. PAULSON
Publisher

Cambridge University Press (CUP)


Related search

Gödel’s Incompleteness Theorems

2019English

Finite Sets and Gödel's Incompleteness Theorems

Dissertationes Mathematicae
Mathematics
2003English

Gödel’s Incompleteness Theorems and Artificial Life

Techné: Research in Philosophy and Technology
1997English

A Proof Theory for Machine Code

ACM Transactions on Programming Languages and Systems
Software
2007English

Saving Proof From Paradox: Gödel’s Paradox and the Inconsistency of Informal Mathematics

Trends in Logic
2016English

Pointwise Ergodic Theorems for Arithmetic Sets

Publications Mathématiques
Mathematics
1989English

Representatives for Finite Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1989English

The Theorems of F. And M. Riesz for Circular Sets.

Mathematica Scandinavica
Mathematics
1973English

Finite Point Sets in Recognizing Location and Orientation of Machine Parts of Complex Shapes

Pattern Analysis and Applications
Computer VisionPattern RecognitionArtificial Intelligence
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy