Sciweavers

491 search results - page 7 / 99
» Linear Quantifier Elimination
Sort
View
ICTCS
2003
Springer
14 years 20 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
MICS
2010
62views more  MICS 2010»
13 years 2 months ago
Linear Differential Elimination for Analytic Functions
This paper provides methods to decide whether a given analytic function of several complex variables is a linear combination of finitely many given analytic functions with coeffic...
Wilhelm Plesken, Daniel Robertz
CSL
2009
Springer
13 years 11 months ago
Intersection, Universally Quantified, and Reference Types
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
Mariangiola Dezani-Ciancaglini, Paola Giannini, Si...