Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options questions only not deleted user 65915

Nonstandard analysis is a way of doing calculus and analysis with infinitesimals. The historical approach of Leibniz, Euler, and others to infinitesimal calculus was gradually replaced by epsilon, delta techniques in the context of a real continuum, in the 19th century. It was not until the 1960s that Abraham Robinson developed a theory of a hyperreal continuum that allows for a development of analysis procedurally akin to that of its founders.

5 votes
3 answers
834 views

Turing degree of a turing machine with access to an (arbitrary) nonstandard integer

Let us consider Turing machines (or other Turing-complete model of computation) that, in addition to their regular input, are given some integer $H$, where $H$ is positive nonstandard. This means, in …
Christopher King's user avatar
9 votes
2 answers
970 views

A definition of topology using monads (a.k.a. halos)

In nonstandard analysis, there is a way of studying topological spaces known as "monads" (more commonly known as halos, as it turns out). The monad of a point $x$ (written $\mu(x))$ is the set of all …
Christopher King's user avatar
3 votes
0 answers
181 views

In constructive set theory, is it consistent for there to be a ring that models smooth infin...

In a constructive set theory such as CZF, it is consistent to assume that every function $f : \mathbb R \to \mathbb R$ is continuous. However, it is not consistent to assume that every such function i …
Christopher King's user avatar
12 votes
2 answers
554 views

Decidability of a first-order theory of hyperreals

The theory of real closed fields is decidable. The hyperreals satisfy that theory, so we can interpret statements in the theory of real closed fields as being about hyperreals. If we add a unary predi …
Christopher King's user avatar
8 votes
1 answer
530 views

What is the Turing degree associated with an ultrafilter $U$?

I asked Turing degree of a turing machine with access to an (arbitrary) nonstandard integer, not thinking about the possiblity that this could depend on the model used. The question was not formulated …
Christopher King's user avatar
5 votes
1 answer
204 views

What is the theory of computably saturated models of ZFC with an *externally well-founded* p...

For any model of $M$ of ZFC, we can extend it to a model $M_{ew}$ with an "externally well-founded" predicate $ew$. For $x \in M$, We say that $M_{ew} \vDash ew(x)$ when there is no infinite sequence …
Christopher King's user avatar
8 votes
3 answers
491 views

Is there a constructive version of internal set theory?

Is there a theory T such that: T includes all the axioms of CZF. T includes the Idealization, Standardization, and Transfer schemas from IST. Every axiom of T is a theorem of IST. T has Church's rule …
Christopher King's user avatar