In this paper, we prove that a pseudo-exponential field has continuum many nonisomorphic countable real closed exponential subfields, each with an order-preserving exponential map which is surjective onto the nonnegative elements. Indeed, this is true of any algebraically closed exponential field satisfying Schanuel’s conjecture.

It is common to assimilate Marx’s and Spinoza’s conceptions of democracy. In this chapter, I assess the relation between Marx’s early idea of “true democracy” and Spinozist democracy, both the historical influence and the theoretical affinity. Drawing on Marx’s student notebooks on Spinoza’s Theological-Political Treatise, I show there was a historical influence. However, at the theoretical level, I argue that a sharp distinction must be drawn. Philosophically, Spinoza’s commitment to understanding politics through real concrete powers does not support with (...) Marx’s anti-institutional conception of true democracy. And as a matter of social theory, the gap between civil society and the state which so troubles Marx is a development of modernity that has not entered Spinoza's premodern field of view. Marx’s true democracy was also influenced by his study of Rousseau, and theoretically, it is just as close if not closer to Rousseau as to Spinoza. (shrink)

The paper shows elimination of imaginaries for real closed valued fields to suitable sorts. We also show that this result is in some sense optimal. The paper includes a quantifier elimination theorem for real closed valued fields in a language with sorts for the field, value group and residue field.

Shepherdson [14] showed that for a discrete ordered ring I, I is a model of IOpen iff I is an integer part of a real closed ordered field. In this paper, we consider integer parts satisfying PA. We show that if a real closed ordered field R has an integer part I that is a nonstandard model of PA (or even IΣ₄), then R must be recursively saturated. In particular, the real closure of I, RC (...) (I), is recursively saturated. We also show that if R is a countable recursively saturated real closed ordered field, then there is an integer part I such that R = RC(I) and I is a nonstandard model of PA. (shrink)

We present a canonical form for definable subsets of algebraically closed valued fields by means of decompositions into sets of a simple form, and do the same for definable subsets of real closed valued fields. Both cases involve discs, forming "Swiss cheeses" in the algebraically closed case, and cuts in the real closed case. As a step in the development, we give a proof for the fact that in "most" valued fields (...) F, if f(x),g(x) ∈ F[ x] and v is the valuation map, then the set {x : v(f(x)) ≤ v(g(x))} is a Boolean combination of discs; in fact, it is a finite union of Swiss cheeses. The development also depends on the introduction of "valued trees", which we define formally. (shrink)

Let us call an integer part of an ordered field any subring such that every element of the field lies at distance less than 1 from a unique element of the ring. We show that every real closed field has an integer part.

We define a notion of residue field domination for valued fields which generalizes stable domination in algebraically closed valued fields. We prove that a real closed valued field is dominated by the sorts internal to the residue field, over the value group, both in the pure field and in the geometric sorts. These results characterize forking and þ-forking in real closed valued fields (and also algebraically closed valued fields). We lay (...) some groundwork for extending these results to a power-bounded T-convex theory. (shrink)

We prove that (additive) ordered group reducts of nonstandard models of the bounded arithmetical theory are recursively saturated in a rich language with predicates expressing the integers, rationals, and logarithmically bounded numbers. Combined with our previous results on the construction of the real exponential function on completions of models of, we show that every countable model of is an exponential integer part of a real‐closed exponential field.

In the present paper some tools are given to state the exact number of roots for some simple classes of exponential terms . The result were obtained by generalizing Sturm's technique for real closed fields. Moreover for arbitrary non-zero terms t certain estimations concerning the location of roots of t are given. MSC: 03C65, 03C60, 12L12.

We give an intuitionistic axiomatisation of real closed fields which has the constructive reals as a model. The main result is that this axiomatisation together with just the decidability of the order relation gives the classical theory of real closed fields. To establish this we rely on the quantifier elimination theorem for real closed fields due to Tarski, and a conservation theorem of classical logic over intuitionistic logic for geometric theories.

Assuming “Schanuel's Condition” for a certain class of exponential fields, Sturm's technique for polynomials in real closed fields can be extended to more complicated exponential terms in the corresponding exponential field. Hence for this class of terms the exact number of zeros can be calculated. These results give deeper insights into the model theory of exponential fields. MSC: 03C65, 03C60, 12L12.

The following conjecture is due to Shelah–Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non‐trivial definable henselian valuation, in the language of rings. We specialise this conjecture to ordered fields in the language of ordered rings, which leads towards a systematic study of the class of strongly NIP almost real closed fields. As a result, we obtain a complete characterisation of this class.

We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field. With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of computably approximable reals (c.a. reals) form (...) class='Hi'>real closed fields. The d.c.e. result was also proved nearly simultaneously and independently by Ng (Keng Meng Ng. Master's Thesis. National University of Singapore, in preparation). Lastly, we show that the class of d.c.e. reals is properly contained in the class or reals less random than Ω (the halting probability), which in turn is properly contained in the class of c.a. reals, and that neither the first nor last class is a randomness class (as captured by rK-reducibility). (shrink)

Jan Krajíček posed the following problem: Is there is a generalization result in the theory of real closed fields of the form: If A is provable in length k for all n ϵ ω , then A is provable? It is argued that the answer to this question depends on the particular formulation of the “theory of real closed fields.” Four distinct formulations are investigated with respect to their generalization behavior. It is shown that (...) there is a positive answer to Krajíček's question for 1. the axiom system RCF of Artin-Schreier with Gentzen's LK as underlying logical calculus, 2. RCF with the variant LK B of LK allowing introduction of several quantifiers of the same type in one step, 3. LK B and the first-order schemata corresponding to Dedekind cuts and the supremum principle. A negative answer is given for 4. any system containing the schema of extensionality. (shrink)

We introduce a new construction of real closed fields by using an elementary extension of an ordered field with an integer part satisfying. This method can be extend to a finite extension of an ordered field with an integer part satisfying. In general, a field obtained from our construction is either real closed or algebraically closed, so an analogy of Ostrowski's dichotomy holds. Moreover we investigate recursive saturation of an o‐minimal extension of a (...) class='Hi'>real closed field by finitely many function symbols. (shrink)

Several researchers have recently established that for every Turing degree \, the real closed field of all \-computable real numbers has spectrum \. We investigate the spectra of real closed fields further, focusing first on subfields of the field \ of computable real numbers, then on archimedean real closed fields more generally, and finally on non-archimedean real closed fields. For each noncomputable, computably enumerable set C, we produce (...) a real closed C-computable subfield of \ with no computable copy. Then we build an archimedean real closed field with no computable copy but with a computable enumeration of the Dedekind cuts it realizes, and a computably presentable nonarchimedean real closed field whose residue field has no computable presentation. (shrink)

We present some results concerning elimination of quantifiers and elementary equivalence for Boolean products of real closed valuation rings and fields. We also study rings of continuous functions and rings of definable functions over real closed valuation rings under this point of view.

We study the model theory of fields k carrying a henselian valuation with real closed residue field. We give a criteria for elementary equivalence and elementary inclusion of such fields involving the value group of a not necessarily definable valuation. This allows us to translate theories of such fields to theories of ordered abelian groups, and we study the properties of this translation. We also characterize the first-order definable convex subgroups of a given ordered abelian (...) group and prove that the definable real valuation rings of k are in correspondence with the definable convex subgroups of the value group of a certain real valuation of k. (shrink)

By RCA 0 , we denote a subsystem of second order arithmetic based on Δ0 1 comprehension and Δ0 1 induction. We show within this system that the real number system R satisfies all the theorems (possibly with non-standard length) of the theory of real closed fields under an appropriate truth definition. This enables us to develop linear algebra and polynomial ring theory over real and complex numbers, so that we particularly obtain Hilbert’s Nullstellensatz in (...) RCA 0. (shrink)

In 2001, the algebraico-tree-theoretic simplicity hierarchical structure of J. H. Conway’s ordered field ${\mathbf {No}}$ of surreal numbers was brought to the fore by the first author and employed to provide necessary and sufficient conditions for an ordered field to be isomorphic to an initial subfield of ${\mathbf {No}}$, i.e. a subfield of ${\mathbf {No}}$ that is an initial subtree of ${\mathbf {No}}$. In this sequel, analogous results are established for ordered exponential fields, making use of a slight (...) generalization of Schmeling’s conception of a transseries field. It is further shown that a wide range of ordered exponential fields are isomorphic to initial exponential subfields of $$. These include all models of $T$, where ${\mathbb R}_W$ is the reals expanded by a convergent Weierstrass system W. Of these, those we call trigonometric-exponential fields are given particular attention. It is shown that the exponential functions on the initial trigonometric-exponential subfields of ${\mathbf {No}}$, which includes ${\mathbf {No}}$ itself, extend to canonical exponential functions on their surcomplex counterparts. The image of the canonical map of the ordered exponential field ${\mathbb T}^{LE}$ of logarithmic-exponential transseries into ${\mathbf {No}}$ is shown to be initial, as are the ordered exponential fields ${\mathbb R})^{EL}$ and ${\mathbb R}\langle \langle \omega \rangle \rangle $. (shrink)

We give a valuation theoretic characterization for a real closed field to be recursively saturated. This builds on work in [9], where the authors gave such a characterization forκ-saturation, for a cardinal$\kappa \ge \aleph _0 $. Our result extends the characterization of Harnik and Ressayre [7] for a divisible ordered abelian group to be recursively saturated.

In this paper, we continue investigations into the asymptotic behavior of solutions of differential equations over o-minimal structures.Let ℜ be an expansion of the real field (ℝ, +, ·).A differentiable mapF= (F1,…,F1): (a, b) → ℝiisℜ-Pfaffianif there existsG: ℝ1+l→ ℝldefinable in ℜ such thatF′(t) =G(t, F(t)) for allt∈ (a, b) and each component functionGi: ℝ1+l→ ℝ is independent of the lastl−ivariables (i= 1, …,l). If ℜ is o-minimal andF: (a, b) → ℝlis ℜ-Pfaffian, then (ℜ,F) is o-minimal (Proposition 7). (...) We say thatF: ℝ → ℝlis ultimately ℜ-Pfaffian if there existsr∈ ℝ such that the restrictionF↾(r, ∞) is ℜ-Pfaffian. (In general,ultimatelyabbreviates “for all sufficiently large positive arguments”.)The structure ℜ isclosed under asymptotic integrationif for each ultimately non-zero unary (that is, ℝ → ℝ) functionfdefinable in ℜ there is an ultimately differentiable unary functiongdefinable in ℜ such that limt→+∞[g′(t)/f(t)] = 1- If ℜ is closed under asymptotic integration, then ℜ is o-minimal and definesex: ℝ → ℝ (Proposition 2).Note that the above definitions make sense for expansions of arbitrary ordered fields. (shrink)

For the classA of uncountable Archimedian real closed fields we show that the statement “TheL <ω-theory ofA is complete” is independent of ZFC. In particular we have the following results:Assuming the Continuum-Hypothesis (CH) is incomplete. Conversely it is possible to build a model of set theory in which is complete and decidable. The latter can also be deduced from the Proper Forcing Axiom (PFA). In this case turns out to be equivalent to the elementary theory of the (...) real numbers ℝ (by a quantifier-elimination procedure).Formally: is incomplete. is complete and decidable. (shrink)

We construct and study structures imitating the field of complex numbers with exponentiation. We give a natural, albeit non first-order, axiomatisation for the corresponding class of structures and prove that the class has a unique model in every uncountable cardinality. This gives grounds to conjecture that the unique model of cardinality continuum is isomorphic to the field of complex numbers with exponentiation.

An exponential $\exp $ on an ordered field $$. The structure $$ is then called an ordered exponential field. A linearly ordered structure $$ is called o-minimal if every parametrically definable subset of M is a finite union of points and open intervals of M.The main subject of this thesis is the algebraic and model theoretic examination of o-minimal exponential fields $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition (...) $\exp = 1$. This study is mainly motivated by the Transfer Conjecture, which states as follows:Any o-minimal exponential field $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp =1$ is elementarily equivalent to $\mathbb {R}_{\exp }$.Here, $\mathbb {R}_{\exp }$ denotes the real exponential field $$, where $\exp $ denotes the standard exponential $x \mapsto \mathrm {e}^x$ on $\mathbb {R}$. Moreover, elementary equivalence means that any first-order sentence in the language $\mathcal {L}_{\exp } = \{+,-,\cdot,0,1, <,\exp \}$ holds for $$ if and only if it holds for $\mathbb {R}_{\exp }$.The Transfer Conjecture, and thus the study of o-minimal exponential fields, is of particular interest in the light of the decidability of $\mathbb {R}_{\exp }$. To the date, it is not known if $\mathbb {R}_{\exp }$ is decidable, i.e., whether there exists a procedure determining for a given first-order $\mathcal {L}_{\exp }$ -sentence whether it is true or false in $\mathbb {R}_{\exp }$. However, under the assumption of Schanuel’s Conjecture—a famous open conjecture from Transcendental Number Theory—a decision procedure for $\mathbb {R}_{\exp }$ exists. Also a positive answer to the Transfer Conjecture would result in the decidability of $\mathbb {R}_{\exp }$. Thus, we study o-minimal exponential fields with regard to the Transfer Conjecture, Schanuel’s Conjecture, and the decidability question of $\mathbb {R}_{\exp }$.Overall, we shed light on the valuation theoretic invariants of o-minimal exponential fields—the residue field and the value group—with additional induced structure. Moreover, we explore elementary substructures and extensions of o-minimal exponential fields to the maximal ends—the smallest elementary substructures being prime models and the maximal elementary extensions being contained in the surreal numbers. Further, we draw connections to models of Peano Arithmetic, integer parts, density in real closure, definable Henselian valuations, and strongly NIP ordered fields.Parts of this thesis were published in [2–5].Abstract prepared by Lothar Sebastian KrappE-mail: [email protected]: https://d-nb.info/1202012558/34. (shrink)

In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and orders. Afterwards, we combine the results from our study of these sets as orders with a classical construction from Avraham to obtain a restriction about how non trivial automorphism of the Turing degrees (if they exist) interact with 1-generic degrees.

In [F.-V. Kuhlmann, S. Kuhlmann, S. Shelah, Exponentiation in power series fields, Proc. Amer. Math. Soc. 125 3177–3183] it was shown that fields of generalized power series cannot admit an exponential function. In this paper, we construct fields of generalized power series with bounded support which admit an exponential. We give a natural definition of an exponential, which makes these fields into models of real exponentiation. The method allows us to construct for (...) every κ regular uncountable cardinal, 2κ pairwise non-isomorphic models of real exponentiation , but all isomorphic as ordered fields. Indeed, the 2κ exponentials constructed have pairwise distinct growth rates. This method relies on constructing lexicographic chains with many automorphisms. (shrink)

The Expanse does not provide an easy answer to the vexing question on making a decision when competing, but considering conflicts of values on the show can help us reason about tough choices in real life. Sometimes, scientific progress conflicts with the prudential value of self‐preservation. This chapter explains three ways of understanding value conflicts: as situations in which every option is forbidden, situations in which every option is permissible, or situations in which some options are obligatory and some (...) options are forbidden. The idea that all these different kinds of value can be traded with a common currency is tempting. But contra Keats, beauty is not truth; and it certainly is not goodness, as Tolstoy says. Epistemic, moral, prudential, and aesthetic values are very different. (shrink)

We prove that no restriction of the sine function to any (open and nonempty) interval is definable in $\langle\mathbf{R}, +, \cdot, , and that no restriction of the exponential function to an (open and nonempty) interval is definable in $\langle \mathbf{R}, +, \cdot, , where $\sin_0(x) = \sin(x)$ for x ∈ [ -π,π], and $\sin_0(x) = 0$ for all $x \not\in\lbrack -\pi,\pi\rbrack$.

The collaboration of Language and Computing nv (L&C) and the Institute for Formal Ontology and Medical Information Science (IFOMIS) is guided by the hypothesis that quality constraints on ontologies for software ap-plication purposes closely parallel the constraints salient to the design of sound philosophical theories. The extent of this parallel has been poorly appreciated in the informatics community, and it turns out that importing the benefits of phi-losophical insight and methodology into application domains yields a variety of improvements. L&C’s LinKBase® (...) is one of the world’s largest medical domain ontologies. Its current primary use pertains to natural language processing ap-plications, but it also supports intelligent navigation through a range of struc-tured medical and bioinformatics information resources, such as SNOMED-CT, Swiss-Prot, and the Gene Ontology (GO). In this report we discuss how and why philosophical methods improve both the internal coherence of LinKBase®, and its capacity to serve as a translation hub, improving the interoperability of the ontologies through which it navigates. (shrink)