Mostrar el registro sencillo del ítem

dc.contributor.author
Figueira, Santiago  
dc.contributor.author
Gorin, Daniel Alejadro  
dc.contributor.author
Grimson, Rafael  
dc.date.available
2018-01-02T18:00:29Z  
dc.date.issued
2014-04  
dc.identifier.citation
Grimson, Rafael; Gorin, Daniel Alejadro; Figueira, Santiago; Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies; Elsevier Inc; Journal of Computer and System Sciences; 80; 6; 4-2014; 1102-1118  
dc.identifier.issn
0022-0000  
dc.identifier.uri
http://hdl.handle.net/11336/31998  
dc.description.abstract
It is well-known that Independence Friendly (IF) logic is equivalent to existential secondorder logic (Σ1 1 ) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended IF-logic, on the other hand, corresponds to a proper fragment of 1 2. In this article we consider SL(↓), IF-logic extended with Hodges’ flattening operator ↓, which allows to define a classical negation. SL(↓) contains Extended IF-logic and hence it is at least as expressive as the Boolean closure of Σ1 1 . We prove that SL(↓) corresponds to a weak syntactic fragment of SO which we show to be strictly contained in 1 2. The separation is derived almost trivially from the fact that Σ1 n defines its own truth-predicate. We finally show that SL(↓) is equivalent to the logic of Henkin quantifiers, which shows, we argue, that Hodges’ notion of negation is adequate.  
dc.format
application/pdf  
dc.language.iso
eng  
dc.publisher
Elsevier Inc  
dc.rights
info:eu-repo/semantics/openAccess  
dc.rights.uri
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/  
dc.subject
Independence Friendly Logic  
dc.subject
Second Order Logic  
dc.subject
Henkin Quantifiers  
dc.subject
Classical Negation  
dc.subject.classification
Matemática Pura  
dc.subject.classification
Matemáticas  
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS  
dc.title
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies  
dc.type
info:eu-repo/semantics/article  
dc.type
info:ar-repo/semantics/artículo  
dc.type
info:eu-repo/semantics/publishedVersion  
dc.date.updated
2017-12-29T14:22:25Z  
dc.journal.volume
80  
dc.journal.number
6  
dc.journal.pagination
1102-1118  
dc.journal.pais
Estados Unidos  
dc.description.fil
Fil: Figueira, Santiago. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina  
dc.description.fil
Fil: Gorin, Daniel Alejadro. Friedrich Alexander Universität Erlangen-Nürnberg. Department of Computer Science; Alemania. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina  
dc.description.fil
Fil: Grimson, Rafael. Universidad Nacional de San Martín. Escuela de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina  
dc.journal.title
Journal of Computer and System Sciences  
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0022000014000488  
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.jcss.2014.04.004