Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings
DOI10.2307/421058zbMath0968.03036OpenAlexW2033498708MaRDI QIDQ4527935
Jan Krajíček, Thomas J. Scanlon
Publication date: 5 July 2001
Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://www.math.ucla.edu/~asl/bsl/0603-toc.htm
Euler characteristicsbounded arithmeticGrothendieck ringcounting functionsfirst-order structurelocally finite structures
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Models of arithmetic and set theory (03C62) Complexity of proofs (03F20) Basic properties of first-order languages and structures (03C07)
Related Items (21)
Cites Work
- Exponential lower bounds for the pigeonhole principle
- Germs of arcs on singular algebraic varieties and motivic integration
- Endomorphisms of symbolic algebraic varieties
- The elementary theory of finite fields
- Every two elementarily equivalent models have isomorphic ultrapowers
- Provability of the pigeonhole principle and the existence of infinitely many primes
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
- Existence and feasibility in arithmetic
This page was built for publication: Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings