Re: fastest way to print a lot of pdf files?

Mark South <mark.south@xxxxxxxxxxxx> wrote:
> On Thu, 08 Dec 2005 18:23:52 +0100, Peter T. Breuer wrote:

>> Mark South <mark.south@xxxxxxxxxxxx> wrote:
>>> On Thu, 08 Dec 2005 05:05:46 -0800, JSorel wrote:
>>
>>>> I have a huge amount of pdf files to print (I used pdftk to merge them
>>>> in groups of 1000, but that's not the point).
>>
>>> PDF files are still countable, aren't they?
>>
>> Not if new ones accumulate faster than you can count.

> Curiously, countability doesn't depend on pre-existence, only on
> generation according to a countable scheme.

I'm afraid you will have to show me a procedure ("scheme") for
counting them in order to convince me.

What? You can't? Will your argument be "they are countable, so you can
count them in some way"? Uh uh.

(clue: one of us is a mathematical logician, and the other is not, one
of us knows the axiom of choice is independent of the other axioms of
set theory, etc.).

> He should, of course, have said "a huge number".

> And you knew both those things already.

:-).


>>> Best solution: don't print all this stuff.
>>
>> Amen.

> And praise the web!

May your electrons be spun with one third positive rotation, brother!


Peter
.

Relevant Pages

  • Re: Is one-to-one mapping valid for comparing infinite-sized sets?
    ... what one bottle without bottom contains with what another ... Countability and infinity are two different properties. ... To do that one must reject the axiom of choice even in its weaker axiom ...
    (sci.math)
  • Re: fastest way to print a lot of pdf files?
    ... >> Curiously, countability doesn't depend on pre-existence, only on ... Fortunately the number of pdf files is finite, so the axiom of choice is ...
    (comp.os.linux.misc)
  • Re: fastest way to print a lot of pdf files?
    ... >>> Not if new ones accumulate faster than you can count. ... >> Curiously, countability doesn't depend on pre-existence, only on ... It is axiomatic that I choose not to choose the axiom of choice to be ...
    (comp.os.linux.misc)
  • Re: Dependant Choice.
    ... Axiom of Countability:if F is a formula in which x is not free then ... were Countability refers to the schema I have just wrote above. ... No, sorry, actually this theory is a bit more powerful than Z-R. ... Size Comprehension: If F is a formula in which x is not free then ...
    (sci.math)
  • Re: Dependant Choice.
    ... Axiom of Countability:if F is a formula in which x is not free then ... were Countability refers to the schema I have just wrote above. ... Also I think that If I add Size Comprehension and Regularity as below, ...
    (sci.math)