ABSTRACTA probability model is underdetermined when there is no rational reason to assign a particular infinitesimal value as the probability of single events. Pruss claims that hyperreal probabilities are underdetermined. The claim is based upon external hyperreal-valued measures. We show that internal hyperfinite measures are not underdetermined. The importance of internality stems from the fact that Robinson’s transfer principle only applies to internal entities. We also evaluate the claim that transferless ordered fields may have advantages over hyperreals in probabilistic modeling. (...) We show that probabilities developed over such fields are less expressive than hyperreal probabilities. (shrink)

In [01], we gave algebraic characterizations of elementary equivalence for finitely generated finite-by-abelian groups, i.e. finitely generated FC-groups. We also provided several examples of finitely generated finite-by-abelian groups which are elementarily equivalent without being isomorphic. In this paper, we shall use our previous results to describe precisely the models of the theories of finitely generated finite-by-abelian groups and the elementary embeddings between these models.

It is well known that, in the terminology of Moschovakis, Descriptive set theory (1980), every adequate normed pointclass closed under ∀ω has an effective version of the generalized reduction property (GRP) called the easy uniformization property (EUP). We prove a dual result: every adequate normed pointclass closed under ∃ω has the EUP. Moschovakis was concerned with the descriptive set theory of subsets of Polish topological spaces. We set up a general framework for parts of descriptive set theory and prove results (...) that have as special cases not only the just-mentioned topological results, but also corresponding results concerning the descriptive set theory of classes of structures. Vaught (1973) asked whether the class of cPCδ classes of countable structures has the GRP. It does. A cPC(A) class is the class of all models of a sentence of the form ¬∃K̄φ, where φ is a sentence of L∞ω that is in A and K̄ is a set of relation symbols that is in A. Vaught also asked whether there is any primitive recursively closed set A such that some effective version of the GRP holds for the class of cPC(A) classes of countable structures. There is: The class of cPC(A) classes of countable structures has the EUP if ω ∈ A and A is countable and primitive recursively closed. Those results and some extensions are obtained by first showing that the relevant classes of classes of structures, which Vaught showed normed, are in a suitable sense adequate and closed under ∃ω, and then applying the dual easy uniformization theorem. (shrink)

f The purpose of this paper is to investigate categoricity arguments conducted in second order logic and the philosophical conclusions that can be drawn from them. We provide a way of seeing this result, so to speak, through a first order lens divested of its second order garb. Our purpose is to draw into sharper relief exactly what is involved in this kind of categoricity proof and to highlight the fact that we should be reserved before drawing powerful philosophical conclusions (...) from it. (shrink)

Under a proper translation, the languages of propositional (and quantified relevant logic) with an absurdity constant are characterized as the fragments of first order logic preserved under (world-object) relevant directed bisimulations. Furthermore, the properties of pointed models axiomatizable by sets of propositional relevant formulas have a purely algebraic characterization. Finally, a form of the interpolation property holds for the relevant fragment of first order logic.

We deal with several pcf problems: we characterize another version of exponentiation: maximal number of κ-branches in a tree with λ nodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras. Also we give cardinal invariants for each λ with a pcf restriction and investigate further T D (f). The sections can be read independently, although there are some minor dependencies.

This paper assembles a unifying framework encompassing a wide variety of mathematical instruments used to compare different theories. The main theme will be the idea that theory comparison techniques are most easily grasped and organized through the lens of category theory. The paper develops a table of different equivalence relations between theories and then answers many of the questions about how those equivalence relations are themselves related to each other. We show that Morita equivalence fits into this framework and provide (...) answers to questions left open in Barrett and Halvorson [4]. We conclude by setting up a diagram of known relationships and leave open some questions for future work. (shrink)

In this paper we start from the assumption that in a metaphor, or an analogy, some terms belonging to one domain (source domain) are used to refer to objects other than their conventional referents belonging to a possibly different domain (target domain). We describe a formalism, which is based on the First Order Predicate Calculus, for representing the knowledge structure associated with a domain and then develop a theory of Constrained Semantic Transference [CST] which allows the terms and the structural (...) relationships of the source domain to be transferred coherently across to the target domain. We show how metaphors and analogies can be characterized in CST in such a way that many of their cognitive properties con be explained.We then propose a theory of Approximate Semantic Transference [AST] which is a computational version of CST and is derived from it by replacing the coherency requirement with approximate coherency. We show how AST can be used as a basis for designing models of cognitive processes involved in comprehending metaphors and analogies. (shrink)

According to Boole it is possible to deduce the principle of contradiction from what he calls the fundamental law of thought and expresses as \. We examine in which framework this makes sense and up to which point it depends on notation. This leads us to make various comments on the history and philosophy of modern logic.

The fact that Gödel's famous incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of the community of logicians. Indeed, almost every more or less formal treatment of the theorem makes a reference to this connection. Gödel himself remarked in the paper announcing his celebrated result :The analogy between this result and Richard's antinomy leaps to the eye;there is (...) also a close relationship with the ‘liar’ antinomy, since … we are… confronted with a proposition which asserts its own unprovability.In the light of the fact that the existence of this connection is commonplace it is all the more surprising that very little can be learnt about its exact nature except perhaps that it is some kind of similarity or analogy. There is, however, a lot more to it than that. Indeed, as we shall try to show below, the general ideas underlying the three central theorems concerning internal limitations of formal deductive systems can be taken as different ways to resolve the Liar paradox. More precisely, it will turn out that an abstract formal variant of the Liar paradox, which can almost straightforwardly inferred from its original ordinary language version, is a possible common generalization of Gödel's incompleteness theorem, the theorem of Tarski on the undefinability of truth, and that of Church concerning the undecidability of provability. (shrink)

In well-known papers ([A-K1], [A-K2], and [E]) J. Ax, S. Kochen, and J. Ershov prove a transfer theorem for henselian valued fields. Here we prove an analogue for henselian valued and ordered fields. The orders for which this result apply are the usual orders and also the higher level orders introduced by E. Becker in [B1] and [B2]. With certain restrictions, two henselian valued and ordered fields are elementarily equivalent if and only if their value groups (with a little bit (...) more structure) and their residually ordered residue fields (a henselian valued and ordered field induces in a natural way an order in its residue field) are elementarily equivalent. Similar results are proved for elementary embeddings and ∀-extensions (extensions where the structure is existentially closed). (shrink)

The standard notion of formal theory, in logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed to accept. In reviewing the main abstract approaches to the study of logical consequence, we point out why this notion of theory is unsatisfactory at multiple levels, and introduce a novel notion of theory that attacks the shortcomings of the received notion by (...) allowing one to take both assertions and denials on a par. This novel notion of theory is based on a bilateralist approach to consequence operators, which we hereby introduce, and whose main properties we investigate in the present paper. (shrink)

Robinson and Zakon gave necessary and sufficient conditions for an abelian ordered group to satisfy the same first‐order sentences as an archimedean abelian ordered group (i.e., which embeds in the group of real numbers). The present paper generalizes their work to obtain similar results for infinite subgroups of the group of unimodular complex numbers. Furthermore, the groups which satisfy the same first‐order sentences as ultraproducts of finite cyclic groups are characterized.

On the set of all first-order complete theories $$T(\sigma )$$ of a language $$\sigma $$ we define a binary operation $$\{\cdot \}$$ by the rule: $$T\cdot S= {{\,\textrm{Th}\,}}(\{A\times B\mid A\models T \,\,\text {and}\,\, B\models S\})$$ for any complete theories $$T, S\in T(\sigma )$$. The structure $$\langle T(\sigma );\cdot \rangle $$ forms a commutative semigroup. A subsemigroup S of $$\langle T(\sigma );\cdot \rangle $$ is called an absorption’s formula definable semigroup if there is a complete theory $$T\in T(\sigma )$$ such that (...) $$S=\langle \{X\in T(\sigma )\mid X\cdot T=T\};\cdot \rangle $$. In this event we say that a theory T absorbs S. In the article we show that for any absorption’s formula definable semigroup S the class $${{\,\textrm{Mod}\,}}(S)=\{A\in {{\,\textrm{Mod}\,}}(\sigma )\mid A\models T_0\,\,\text {for some}\,\, T_0\in S\}$$ is axiomatizable, and there is an idempotent element $$T\in S$$ that absorbs S. Moreover, $${{\,\textrm{Mod}\,}}(S)$$ is finitely axiomatizable provided T is finitely axiomatizable. We also prove that $${{\,\textrm{Mod}\,}}(S)$$ is a quasivariety (variety) provided T is an universal (a positive universal) theory. Some examples are provided. (shrink)