A major theme in the study of degree structures of all types has been the question of the decidability or undecidability of their first order theories. This is a natural and fundamental question that is an important goal in the analysis of these structures. In this paper, we study decidability for theories of upper semilattices that arise from the theory of numberings. We use the following approach: given a level of complexity, say \, we consider the upper semilattice (...) \ of all \-computable numberings of all \-computable families of subsets of \. We prove that the theory of the semilattice of all computable numberings is computably isomorphic to first order arithmetic. We show that the theory of the semilattice of all numberings is computably isomorphic to second order arithmetic. We also obtain a lower bound for the 1-degree of the theory of the semilattice of all \-computable numberings, where \ is a computable successor ordinal. Furthermore, it is shown that for any of the theories T mentioned above, the \-fragment of T is hereditarily undecidable. Similar results are obtained for the structure of all computably enumerable equivalence relations on \, equipped with composition. (shrink)

Let M be a polynomially bounded, o-minimal structure with archimedean prime model, for example if M is a real closed field. Let C be a convex and unbounded subset of M. We determine the first order theory of the structure M expanded by the set C. We do this also over any given set of parameters from M, which yields a description of all subsets of Mn, definable in the expanded structure.

We prove that the theory of all sentences in the language of rings which are true in for almost all is decidable. Here is the field of all algebraic numbers; is the ring of all algebraic integers; is the absolute Galois group of ; for each , is the fixed field of σ1,…,σe in ; and the clause ‘almost all’ is used in the sense of the Haar measure of.

We show that the ordered field of real numbers with restricted $\mathbb{R}_{\mathscr{H}}$-definable analytic functions admits quantifier elimination if we add a function symbol $^{-1}$ for the function $x\mapsto \frac{1}{x}$ (with $0^{-1}=0$ by convention), where $\mathbb{R}_{\mathscr{H}}$ is the real field augmented by the functions in the family $\mathscr{H}$ of restricted parts (real and imaginary) of holomorphic functions which satisfies certain conditions. Further, with another condition on $\mathscr{H}$ we show that the structure ($\mathbb{R}_{\mathscr{H}}$, constants) is strongly model complete.

We give two slight generalizations of results of Poizat about elementary theories of groups obtained by free constructions. The first-one concerns generic types and the non-superstability of such groups in many cases. The second-one concerns the connectedness of most free products of groups without amalgamation.

is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

We give an elementary theory of Henselian local rings and construct the Henselisation of a local ring. All our theorems have an algorithmic content.

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and (...) natural science. This is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields real-valued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense. (shrink)

TheoremEvery model of ZFChas a conservative elementary extension which possesses a cofinal minimal elementary extension.An application of Boolean ultrapowers to models of full arithmetic is also presented.

In thirty years the science of elementary particles has made few achievements compared with its unsuccessful essays. The recent works of Schwinger, Tomonaga, Feynman and Dyson, however, have had some success. We have here a hint that progress is being made on the formal side of the discipline—though even this work is profoundly disturbing in some of its purely mathematical aspects. There could be no better time to review the situation from a physical and philosophical standpoint, even if this (...) proves to be an over-ambitions undertaking. (shrink)

We define a class of functions, the descent recursive functions, relative to an arbitrary elementary recursive system of ordinal notations. By means of these functions, we provide a general technique for measuring the proof-theoretic strength of a variety of systems of first-order arithmetic. We characterize the provable well-orderings and provably recursive functions of these systems, and derive various conservation and equiconsistency results.

We prove the following extension of a result of Keisler and Morley. Suppose U is a countable model of ZFC and c is an uncountable regular cardinal in U. Then there exists an elementary extension of U which fixes all ordinals below c, enlarges c, and either (i) contains or (ii) does not contain a least new ordinal. Related results are discussed.

We establish constructive refinements of several well-known theorems in elementary model theory. The additive group of the real numbers may be embedded elementarily into the additive group of pairs of real numbers, constructively as well as classically.

We introduce an operational set theory in the style of [5] and [16]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has non-extensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self{application is permitted. The system we (...) introduce here is a fully explicit, nitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. (shrink)

A theorem of Enayat's concerning models of ZFC which had been proved using several different additional set-theoretical hypotheses is shown here to be absolute.

Detection theory has been applied to a host of varied problems (for example, measuring the accuracy of diagnostic systems or reliability of lie detection tests) and extends far beyond the detection of signals. This book is a primer on the subject.

We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had (...) previously been open even for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)

The first volume of the Brandeis University Summer Institute lecture series of 1970 on theories of interacting elementary particles, consisting of four sets of lectures. Every summer since 1959 Brandeis University has conducted a lecture series centered on various areas of theoretical physics. The areas are sufficiently broad to interest a large number of physicists and the lecturers are among the original explorers of these areas. The 1970 lectures, presented in two volumes, are on theories of interacting (...) elementary particles. The four lecturers of Volume 1, and the range of the topics they cover, are as follows: Stephen L. Adler on "Perturbation Theory Anomalies": introduction and review of perturbation theory; the VVA triangle anomaly; absence of radiative corrections; generalizations of our results; connection between Ward identity anomalies and commutator anomalies; applications of the Bjorken limit; and breakdown of the Bjorken limit in perturbation theory. Stanley Mandelstam on "Dynamical Applications of the Veneziano formula for the four-point scalar amplitude; factorization; the operator formalism; Veneziano-type quark models; and higher-order Feynman-like diagrams. Steven Weinberg on "Dynamic and Algebraic Symmetries": Introduction; hadron electrodynamics; local symmetries; and chirality. Wolfhart Zimmermann on "Local Operator Products and Renormalization in Quantum Field Theory": introduction; renormalization; operator product expansions; and local field equations. The second volume contains lectures by Rudolf Haag on observables and fields, by Maurice Jacob on duality, by Michael Reed on non-Fock representations, and by Bruno Zumino on effective Lagrangians and broken symmetries. (shrink)

We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness, and are stable in some cardinal. Assuming the singular cardinal hypothesis, we prove a full characterization of the stability cardinals, and connect the stability spectrum with the behavior of saturated models.We deduce that if a class is stable on a tail of cardinals, then it has no long splitting chains. This indicates that there is a clear notion of superstability in this framework.We also present (...) an application to homogeneous model theory: for [Formula: see text] a homogeneous diagram in a first-order theory [Formula: see text], if [Formula: see text] is both stable in [Formula: see text] and categorical in [Formula: see text] then [Formula: see text] is stable in all [Formula: see text]. (shrink)