<--- Back to Details
First PageDocument Content
Mathematical logic / Logic / Automated theorem proving / Proof assistants / Theoretical computer science / Logic in computer science / Abstraction / Nuprl / Constructivism / Type theory / Mathematical proof / Robert Lee Constable
Date: 2012-06-04 13:35:50
Mathematical logic
Logic
Automated theorem proving
Proof assistants
Theoretical computer science
Logic in computer science
Abstraction
Nuprl
Constructivism
Type theory
Mathematical proof
Robert Lee Constable

Proof Assistants and the Dynamic Nature of Formal Theories Robert L. Constable Cornell University Abstract

Add to Reading List

Source URL: dream.inf.ed.ac.uk

Download Document from Source Website

File Size: 34,74 KB

Share Document on Facebook

Similar Documents

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

DocID: 1vah4 - View Document

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

DocID: 1sXwT - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

DocID: 1sOSK - View Document

Microsoft Word - BlankPage

Microsoft Word - BlankPage

DocID: 1rugC - View Document

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

DocID: 1rrok - View Document