Completeness of intuitionistic propositional calculus

Abstract

An assignment is a function f that assigns subsets of N to some atoms. Then f is extended to f* which sends every formula A of HPC to a subset of S(A).

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-01-28

Downloads
184 (#132,408)

6 months
184 (#18,804)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references