First Page | Document Content | |
---|---|---|
Date: 2015-12-16 14:53:21Mathematical 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 ListSource URL: cakeml.orgDownload Document from Source WebsiteFile Size: 273,74 KBShare Document on Facebook |
Characterizations of Pretameness Regula Krapf joint work with Peter Holy and Philipp Schlicht University of Bonn December 8, 2015DocID: 1rc1G - View Document | |
Introduction Descriptive Set Theory in SOA Collapsing a model of ZFC Sharps # Collapsing a model of ZFCDocID: 1qsyF - View Document | |
Motivation The technique of forcing Cohen forcing Lebesgue measure Forcing: How to prove unprovability IDocID: 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://wwDocID: 1obzs - View Document | |
A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott AaronsonDocID: 1o4E0 - View Document |