Sciweavers

369 search results - page 45 / 74
» Arithmetic of Generalized Jacobians
Sort
View
APAL
2007
63views more  APAL 2007»
13 years 8 months ago
Bounded functional interpretation and feasible analysis
In this article we study applications of the bounded functional interpretation to theories of feasible arithmetic and analysis. The main results show that the novel interpretation...
Fernando Ferreira, Paulo Oliva
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 7 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
Frédéric Blanqui, Colin Riba
DCG
2007
79views more  DCG 2007»
13 years 7 months ago
Distance Measures for Well-Distributed Sets
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
Alex Iosevich, Michael Rudnev
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon