<--- Back to Details
First PageDocument Content
Mathematical logic / Mathematics / Logic / Logic in computer science / Proof assistants / Model theory / Proof theory / Foundations of mathematics / ZermeloFraenkel set theory / HOL / Gdel's completeness theorem / Gdel's incompleteness theorems
Date: 2015-12-16 14:53:21
Mathematical logic
Mathematics
Logic
Logic in computer science
Proof assistants
Model theory
Proof theory
Foundations of mathematics
ZermeloFraenkel set theory
HOL
Gdel's completeness theorem
Gdel's incompleteness theorems

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Self-Formalisation of Higher-Order Logic Semantics, Soundness, and a Verified Implementation Ramana Kumar · Rob Arthan ·

Add to Reading List

Source URL: cakeml.org

Download Document from Source Website

File Size: 273,74 KB

Share Document on Facebook

Similar Documents

Characterizations of Pretameness Regula Krapf joint work with Peter Holy and Philipp Schlicht University of Bonn December 8, 2015

Characterizations of Pretameness Regula Krapf joint work with Peter Holy and Philipp Schlicht University of Bonn December 8, 2015

DocID: 1rc1G - View Document

Introduction Descriptive Set Theory in SOA Collapsing a model of ZFC Sharps # Collapsing a model of ZFC

Introduction Descriptive Set Theory in SOA Collapsing a model of ZFC Sharps # Collapsing a model of ZFC

DocID: 1qsyF - View Document

Motivation The technique of forcing Cohen forcing Lebesgue measure  Forcing: How to prove unprovability I

Motivation The technique of forcing Cohen forcing Lebesgue measure Forcing: How to prove unprovability I

DocID: 1qmQn - View Document

KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION MEETS DATABASES Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100 Bolzano, Italy Tel: +, fax: +, http://ww

KRDB RESEARCH CENTRE KNOWLEDGE REPRESENTATION MEETS DATABASES Faculty of Computer Science, Free University of Bozen-Bolzano, Piazza Domenicani 3, 39100 Bolzano, Italy Tel: +, fax: +, http://ww

DocID: 1obzs - View Document

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

DocID: 1o4E0 - View Document