Sciweavers

35 search results - page 1 / 7
» Elementary equivalence of some rings of definable functions
Sort
View
AML
2008
44views more  AML 2008»
13 years 4 months ago
Elementary equivalence of some rings of definable functions
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...
Vincent Astier
BSL
2000
153views more  BSL 2000»
13 years 4 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
ICLP
2007
Springer
13 years 8 months ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
MLQ
2006
76views more  MLQ 2006»
13 years 4 months ago
Geometric properties of semilinear and semibounded sets
We calculate the universal Euler characteristic and universal dimension function on semilinear and semibounded sets and obtain some criteria for definable equivalence of semilinea...
Jana Maríková
CIE
2006
Springer
13 years 8 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek