Computational Logic
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Computational Logic
|
| Id. |
41840581 |
| Idioma |
inglés
|
| Titulo |
Computational Logic |
| Localización |
http://citeseer.ist.psu.edu/405185.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
tresses complexity issues, and how proofs can be analyzed to produce computational
information, proving a version of the famous Dialectica" theorem of Godel. The course concludes with
a discussion of linear logic, a so-called resource-conscious logic; we will discuss the relationship between
cut-elimination (proof simplication) in linear logic, and evaluation of programs written in -calculus.
Required work: Work for the course will include several problem sets, and some class presentations.
Even though I love grading problem sets, I'm going to try to have it done by you on a round-robin basis.
Items marked ? in the syllabus are lectures where you may volunteer to do the presentation if you think
you would nd the subject matter interesting.
There is no textbook for the course|there will, however, be book chapters and papers to read, as
well as class notes.
Grading for the course will
|
| Tipo |
ps
|
| Palabras clave |
Computational Logic
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.cs.brandeis.edu/~mairson/Courses/cs792.ps.gz
[References] oai:CiteSeerPSU:78149
[References] oai:CiteSeerPSU:82633
[References] oai:CiteSeerPSU:27691
[References] oai:CiteSeerPSU:101565
|
| Fecha de contribución |
31-mar-2009 |
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
