scholarly journals A phase semantics for polarized linear logic and second order conservativity

2010 ◽  
Vol 75 (1) ◽  
pp. 77-102 ◽  
Author(s):  
Masahiro Hamano ◽  
Ryo Takemura

AbstractThis paper presents a polarized phase semantics, with respect to which the linear fragment of second order polarized linear logic of Laurent [15] is complete. This is done by adding a topological structure to Girard's phase semantics [9], The topological structure results naturally from the categorical construction developed by Hamano–Scott [12]. The polarity shifting operator ↓ (resp. ↑) is interpreted as an interior (resp. closure) operator in such a manner that positive (resp. negative) formulas correspond to open (resp. closed) facts. By accommodating the exponentials of linear logic, our model is extended to the polarized fragment of the second order linear logic. Strong forms of completeness theorems are given to yield cut-eliminations for the both second order systems. As an application of our semantics, the first order conservativity of linear logic is studied over its polarized fragment of Laurent [16]. Using a counter model construction, the extension of this conservativity is shown to fail into the second order, whose solution is posed as an open problem in [16]. After this negative result, a second order conservativity theorem is proved for an eta expanded fragment of the second order linear logic, which fragment retains a focalized sequent property of [3].

1996 ◽  
Vol 61 (2) ◽  
pp. 541-548 ◽  
Author(s):  
Yves Lafont

AbstractRecently, Lincoln, Scedrov and Shankar showed that the multiplicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-additive fragment of second order classical linear logic is also undecidable, using an encoding of two-counter machines originally due to Kanovich. The faithfulness of this encoding is proved by means of the phase semantics.


1997 ◽  
pp. 127-143
Author(s):  
P. D. Lincoln ◽  
A. Scedrov ◽  
N. Shankar

1991 ◽  
Vol 56 (3) ◽  
pp. 1038-1063 ◽  
Author(s):  
Gaisi Takeuti

In [1] S. Buss introduced systems of bounded arithmetic , , , (i = 1, 2, 3, …). and are first order systems and and are second order systems. and are closely related to and respectively in the polynomial hierarchy, and and are closely related to PSPACE and EXPTIME respectively. One of the most important problems in bounded arithmetic is whether the hierarchy of bounded arithmetic collapses, i.e. whether = or = for some i, or whether = , or whether is a conservative extension of S2 = ⋃i. These problems are relevant to the problems whether the polynomial hierarchy PH collapses or whether PSPACE = PH or whether PSPACE = EXPTIME. It was shown in [4] that = implies and consequently the collapse of the polynomial hierarchy. We believe that the separation problems of bounded arithmetic and the separation problems of computational complexities are essentially the same problem, and the solution of one of them will lead to the solution of the other.


Author(s):  
José Mário Araújo ◽  
Tito Santos

In this article, a novel theorem for eigenvalue perturbation inspired by the results of Brauer is introduced. The new result is valid for single and multiple eigenvalue perturbations, with preservation—no spillover of the remaining spectrum. An application of the proposed results is given since the model updating and the partial eigenvalue assignment problems for second-order linear dynamics have gained crescent attention in the last decades. Furthermore, its effectiveness is illustrated with numerical examples.


Sign in / Sign up

Export Citation Format

Share Document