Sciweavers

26 search results - page 1 / 6
» Strong normalization property for second order linear logic
Sort
View
TCS
2010
14 years 8 months ago
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
Michele Pagani, Lorenzo Tortora de Falco
93
Voted
CORR
2010
Springer
149views Education» more  CORR 2010»
14 years 10 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
84
Voted
AML
2002
112views more  AML 2002»
14 years 10 months ago
Strong normalization of a symmetric lambda calculus for second-order classical logic
Abstract We extend Barbanera and Berardi's symmetric lambda calculus [2] to second order classical propositional logic and prove its strong normalization.
Yoriyuki Yamagata
83
Voted
SIAMCO
2000
110views more  SIAMCO 2000»
14 years 10 months ago
On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
We study the asymptotic behavior at infinity of solutions of a second order evolution equation with linear damping and convex potential. The differential system is defined in a rea...
Felipe Alvarez
101
Voted
LATA
2009
Springer
15 years 5 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle