On the Formulae-as-Types Correspondence for Classical Logic - Doctoral thesis of Charles Stewart, which investigates foundational aspects of the application of the formulae-as-types correspondence to classical logic, and extends the treatment to include intensional equality and induction.

		Sunday, 7 September, 2008
		Home \| Submit Science Site \| Add to Favorite \| Contact

for

Directories

Aeronautics and Aerospace

Agriculture

Anomalies and Alternative Science

Educational Resources

Instruments and Supplies

Math

Medical Science

Methods and Techniques

Category: Science » Math » Logic and Foundations » Computational Logic

UPDATE URL | REPORT BROKEN LINK

On the Formulae-as-Types Correspondence for Classical Logic

Popularity:

Hit: 293 | Visit: 6

Details

	Doctoral thesis of Charles Stewart, which investigates foundational aspects of the application of the formulae-as-types correspondence to classical logic, and extends the treatment to include intensional equality and induction. Sponsored Links:
URL:
Title:	On the Formulae-as-Types Correspondence for Classical Logic
Description:	Science Central - 495614 - Doctoral thesis of Charles Stewart, Oxford University.
Category:	Programs - Types - Michael - Classical - Type - Theory - Thesis - Howard - Charles - Stewart - Logic - Formulae - Arithmetic - Gerhard - Alexander - Doctoral - Semantics - Role - Curry - Inferential - Proofs - Constructive - Heyting - Dphil - Martin-löf's - Peano - Dummett - Prawitz - Gentzen - Nuel - Belnap

Related sites

Dual Identity Combinators (Popularity:

): Article by Katalin BimbÃ³ presented at the 20th World Congress of Philosophy. Investigates the addition ...
Kolmogorov Complexity in Combinatory Logic (Popularity:

): Online article by John Tromp. Kolmogorov complexity is a recursion theoretic characterisation of randomness.
Lambda (Popularity:

): An online introduction to the lambda calculus by Lloyd Allison, complete with a web form ...
Perl Contains the Lambda-Calculus (Popularity:

): Explains why this computer program is well suited to apply to functional application.
Automated Reasoning (Popularity:

): Survey of automated deduction and theorem proving; from the Stanford Encyclopedia of Philosophy by Frederic ...
MetaPRL logical programming environment (Popularity:

): The next generation of the NuPrl proof development system. The main new features of MetaPRL ...
The LEGO Proof Assistant (Popularity:

): A powerful tool for interactive proof development in the natural deduction style. It supports refinement ...
Alfa (Popularity:

): A successor to the proof editor Alf with a graphical user interface, being developed at ...
NuPrl Proof Development System (Popularity:

): A powerful tactic-based proof assistant, developed over the last 15 years at Cornell University. IFeatures ...
Proof General (Popularity:

): Emacs based generic interface for theorem provers.

Home | Submit Science Site | Add to Favorite | Privacy | Contact