Combinatorics with definable sets: Euler characteristics and grothendieck rings

Bulletin of Symbolic Logic 6 (3):311-330 (2000)
  Copy   BIBTEX

Abstract

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 ordered Euler characteristic and Grothendieck ring and give a characterization of structures that have non-trivial partially ordered Grothendieck ring. We give a generalization of counting functions to locally finite structures, and use the construction to show that the Grothendieck ring of the complex numbers contains as a subring the ring of integer polynomials in continuum many variables. We prove the existence of a universal strong Euler characteristic on a structure. We investigate the dependence of the Grothendieck ring on the theory of the structure and give a few counter-examples. Finally, we relate some open problems and independence results in bounded arithmetic to properties of particular Grothendieck rings

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
82 (#200,346)

6 months
14 (#253,070)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Weakly o-minimal nonvaluational structures.Roman Wencel - 2008 - Annals of Pure and Applied Logic 154 (3):139-162.
O-minimalism.Hans Schoutens - 2014 - Journal of Symbolic Logic 79 (2):355-409.
A remark on divisibility of definable groups.Mário J. Edmundo - 2005 - Mathematical Logic Quarterly 51 (6):639-641.
Grothendieck rings of ℤ-valued fields.Raf Cluckers & Deirdre Haskell - 2001 - Bulletin of Symbolic Logic 7 (2):262-269.
Grothendieck rings of theories of modules.Amit Kuber - 2015 - Annals of Pure and Applied Logic 166 (3):369-407.

View all 14 citations / Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
A mathematical incompleteness in Peano arithmetic.Jeff Paris & Leo Harrington - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 90--1133.

Add more references