(Enter summary)
Abstract: We de
ne the notion of approximate Euler characteristic of de
nable
sets of a
rst order structure. We show that a structure admits a
non-trivial approximate Euler characteristic if it satis
es weak pigeonhole
n : two disjoint copies of a non-empty de
nable
set A cannot be de
nably embedded into A, and principle CC of comparing
cardinalities: for any two de
nable sets A, B either A de
nably
embeds in B or vice versa. Also, a structure admitting a non-trivial
approximate Euler... (Update)
Active bibliography (related documents):
0.5: Cutting plane and Frege proofs - Clote
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Combinatorics With Definable Sets: Euler Characteristics And .. - Krajícek, Scanlon
(Correct)
0.3: Combinatorics of First Order Structures and Propositional Proof.. - Krajicek
(Correct)
0.3: Tautologies From Pseudo-Random Generators - Krajícek (2001)
(Correct)
BibTeX entry: (Update)
@misc{ pigeonhole-approximate,
author = "And Weak Pigeonhole",
title = "Approximate Euler characteristic, dimension,",
url = "citeseer.ist.psu.edu/703269.html" }
Citations (may not include all citations):
2
the existence of modulo p cardinality functions (context) - Ajtai - 1994
Documents on the same site (http://www.math.cas.cz/~krajicek/biblio.html): More
Structured Pigeonhole Principle, - Search Problems And
(Correct)
Diagonalization in Proof Complexity - Krajicek
(Correct)
Dehn Function and Length of Proofs - Krajícek
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC