Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

A Deterministic Terminating Sequent Calculus for Gödel-Dummett 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
A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic
Id. 46387971
Idioma inglés
Titulo A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic
Autor(es) Roy Dyckhoff
Godel-dummett Logic
Localización http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.8533
Versión 1.0
Estado Final
Descripción We give a short proof-theoretic treatment of a terminating contraction-free calculus G4-LC for the zero-order Godel-Dummett logic LC. This calculus is a slight variant of a calculus given by Avellone et al, who show its completeness by model-theoretic techniques. In our calculus, all the rules of G4-LC are invertible, thus allowing a deterministic proof-search procedure. Keywords: sequent calculus, contraction-free, terminating, Godel-Dummett logic 1 Introduction In previous work [9] the author gave a "contraction-free calculus" for zero-order intuitionistic logic IPL; following [21] we call this calculus G4ip. It has the property that root-first proof search terminates, thus allowing easy implementation without a loop-checker. See [9] for further history of this calculus, developed independently by Hudelmaier [16] and others, and with ideas from Vorob'ev's 1950 work (presented later in [22]). We now call this a "terminating" calculus to distinguish it from other "contraction-free c...
Tipo application/postscript
Tipo de recurso Texto Narrativo
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Formatos application/postscript
Requerimientos técnicos Browser: Any
Relación [IsBasedOn] http://www-theory.dcs.st-and.ac.uk/~rd/publications/IGPL-1/dyckhoff.ps
[References] 10.1.1.46.7414
[References] 10.1.1.10.6972
[References] 10.1.1.43.8533
[References] 10.1.1.36.6159
[References] 10.1.1.30.8986
[References] 10.1.1.36.6495
[References] 10.1.1.50.2229
[References] 10.1.1.64.8701
[References] 10.1.1.69.8663
[References] 10.1.1.46.9057
[References] 10.1.1.20.6861
[References] 10.1.1.7.3833
[References] 10.1.1.29.1902
[References] 10.1.1.123.4430
[References] 10.1.1.31.6610
[References] 10.1.1.96.3499
[References] 10.1.1.109.5062
Fecha de contribución 24-jul-2009
Contacto

Valoración de los usuarios

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