On a forcing model for non-standard arithmetic
On a forcing model for non-standard arithmetic
On a forcing model for non-standard arithmetic
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Sheaf semantics A <strong>non</strong>-principal ultrafilter A <strong><strong>for</strong>cing</strong> <strong>model</strong> <strong>for</strong> <strong>non</strong>-<strong>standard</strong> <strong>arithmetic</strong> Open questions<br />
The <strong><strong>for</strong>cing</strong> clauses<br />
<strong>On</strong>e is led to the following <strong><strong>for</strong>cing</strong> clauses, where <strong>non</strong>-<strong>standard</strong><br />
natural numbers are interpreted as functions f : N → N:<br />
p −f = g ⇔ <strong>for</strong> all but finitely many n ∈ p, f (n) = g(n)<br />
p −f ≤ g ⇔ <strong>for</strong> all but finitely many n ∈ p, f (n) ≤ g(n)<br />
. . .<br />
Benno van den Berg, TU Darmstadt, Germany <strong>On</strong> a <strong><strong>for</strong>cing</strong> <strong>model</strong> <strong>for</strong> <strong>non</strong>-<strong>standard</strong> <strong>arithmetic</strong>
Change language