Sciweavers

5 search results - page 1 / 1
» Intuitionistic Fixed Point Theories for Strictly Positive Op...
Sort
View
MLQ
2002
67views more  MLQ 2002»
13 years 5 months ago
Intuitionistic Fixed Point Theories for Strictly Positive Operators
In this paper it is shown that the intuitionistic fixed point theory ID i (strict) for times iterated fixed points of strictly positive operator forms is conservative for negativ...
Christian Rüede, Thomas Strahm
CSL
2009
Springer
13 years 9 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
ADCM
2010
129views more  ADCM 2010»
13 years 5 months ago
Construction of positive definite cubature formulae and approximation of functions via Voronoi tessellations
Let Rd be a compact convex set of positive measure. In a recent paper, we established a definiteness theory for cubature formulae of order two on . Here we study extremal propert...
Allal Guessab, Gerhard Schmeisser
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 5 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
IJCAI
1989
13 years 6 months ago
Formal Properties and Implementation of Bidirectional Charts
Several theories of grammar currently converge toward inserting subcategorization information within lexical entries. Such a tendency would benefit from a parsing algorithm able t...
Giorgio Satta, Oliviero Stock