Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Subtractive 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

Marcadores Sociales
Subtractive Logic
Id. 41828226
Idioma inglés
Titulo Subtractive Logic
Autor(es) Tristan Crolard
Localización http://citeseer.ist.psu.edu/392830.html
Versión 1.0
Estado Final
Descripción This paper is the first part of a work whose purpose is to investigate duality in some related frameworks (cartesian closed categories, lambda-calculi, intuitionistic and classical logics) from syntactic, semantical and computational viewpoints. We start with category theory and we show that any bicartesian closed category with coexponents is degenerated (i.e. there is at most one arrow between two objects). The remainder of the paper is devoted to logical issues. We examine the propositional calculus underlying the type system of bicartesian closed categories with coexponents and we show that this calculus corresponds to subtractive logic: a conservative extension of intuitionistic logic with a new connector (subtraction) dual to implication. Eventually, we consider first order subtractive logic and we present an embedding of classical logic into subtractive logic. Introduction This paper is the first part of a work whose purpose is to investigate duality in some related ...
Tipo ps
Palabras clave Tristan Crolard Subtractive Logic
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
unrestricted
Formatos ps
Requerimientos técnicos Browser: Any
Relación [IsBasedOn] http://www.univ-paris12.fr/lacl/crolard/publications/tcs.ps.gz
[References] oai:CiteSeerPSU:255798
Fecha de contribución 31-mar-2009
Contacto

Valoración de los usuarios

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.