In [4] the authors studied the residue field of a model M of IΔ0 + Ω1 for the principal ideal generated by a prime p. One of the main results is that M/ has a unique extension of each finite degree. In this paper we are interested in understanding the structure of any quotient field of M, i.e. we will study the quotient M/I for I a maximal ideal of M. We prove that any quotient field of M satisfies the (...) property of having a unique extension of each finite degree. We will use some of Cherlin's ideas from [3], where he studies the ideal theory of non standard algebraic integers. (shrink)

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.

We introduce prime products as a generalization of ultraproducts for positive logic. Prime products are shown to satisfy a version of Łoś’s Theorem restricted to positive formulas, as well as the following variant of the Keisler Isomorphism Theorem: under the generalized continuum hypothesis, two models have the same positive theory if and only if they have isomorphic prime powers of ultrapowers.

For each natural number n we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than n and no strictly ascending chains. The case n=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=0$$\end{document} is the Gödel-Löb provability logic. Each logic is axiomatised by adding a single axiom to K4, and is shown to have the finite model property and be decidable. We then consider a number of extensions (...) of these logics, including restricting to reflexive frames to obtain a corresponding sequence of extensions of S4. When n=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=1$$\end{document}, this gives the famous logic of Grzegorczyk, known as S4Grz, which is the strongest modal companion to intuitionistic propositional logic. A topological semantic analysis shows that the n-th member of the sequence of extensions of S4 is the logic of hereditarily n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n+1$$\end{document}-irresolvable spaces when the modality ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond$$\end{document} is interpreted as the topological closure operation. We also study the definability of this class of spaces under the interpretation of ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond$$\end{document} as the derived set operation. The variety of modal algebras validating the n-th logic is shown to be generated by the powerset algebras of the finite frames with cycle length bounded by n. Moreover each algebra in the variety is a model of the universal theory of the finite ones, and so is embeddable into an ultraproduct of them. (shrink)

Which ultraproducts preserve the validity of formulas of higher order logics? To answer this question, we will introduce natural topologies on ultraproducts. We will show, that ultraproducts preserving certain higher order formulas can be characterized in terms of these topologies. As an application of the above results, we provide a constructive, purely model theoretic characterization for classes definable by second order existential formulas.

Quantum Kripke frames are certain quantum structures recently introduced by Zhong. He has defined certain properties such as Existence of Approximation and Superposition for these structures. In this paper, we define the ultraproduct for the family of quantum Kripke frames and show that the aforementioned properties are invariant under ultraproduct. In this way we prove that the ultraproduct of each family of quantum Kripke frames is also a quantum Kripke frame. We also show the same results for other related quantum (...) structures. (shrink)

We start by showing how to approximate unitary and bounded self-adjoint operators by operators in finite dimensional spaces. Using ultraproducts we give a precise meaning for the approximation. In this process we see how the spectral measure is obtained as an ultralimit of counting measures that arise naturally from the finite dimensional approximations. Then we see how generalized distributions can be interpreted in the ultraproduct. Finally we study how one can calculate kernels of operators K by calculating them in (...) the finite dimensional approximations and how one needs to interpret Dirac deltas in the ultraproduct in order to get the kernels as propagators $\langle x_{1}|K|x_{0}\rangle $. (shrink)

In this paper we continue our study, begun in [5], of the connection between ultraproducts and saturated structures. IfDis an ultrafilter over a setI, andis a structure, the ultrapower ofmoduloDis denoted byD-prod. The ultrapower is important because it is a method of constructing structures which are elementarily equivalent to a given structure. Our ultimate aim is to find out what kinds of structure are ultrapowers of. We made a beginning in [5] by proving that, assuming the generalized continuum hypothesis, (...) for each cardinalαthere is an ultrafilterDover a set of powerαsuch that for all structures,D-prodisα+-saturated. (shrink)

An important application of ultrafilters is in the ultraproduct construction in model theory. In this paper we study ultraproducts of countable structures, whose universe we assume is ω , using ultrafilters on a countable index set, which we also assume to be ω . Many of the properties of the ultraproduct are in fact inherent properties of the ultrafilter. For example, if we take a sequence of countable linear orders without maximal element, then their ultraproduct will have no maximal (...) element, and we can ask what its cofinality is. This cardinal depends only on the ultrafilter; it does not depend on what linear orders comprise the factors. (shrink)

This note concerns the ultraproduct construction. It is observed that in the class of SCI models ultraproducts may be constructed by a method apparently dierent from the standard one. Since the standard models of veryday model theory form a subclass of SCI models, one obtains a new view of ultraproducts. Aside from a few remarks, the paper is self-contained.

Coalgebras of polynomial functors constructed from sets of observable elements have been found useful in modelling various kinds of data types and state-transition systems. This paper continues the study of equational logic and model theory for polynomial coalgebras begun in Goldblatt , where it was shown that Boolean combinations of equations between terms of observable type form a natural language of observable formulas for specifying properties of polynomial coalgebras, and for giving a Hennessy–Milner style logical characterisation of observational indistinguishability of (...) states.Here we give a structural characterisation of classes of coalgebras definable by observable formulas. This is an analogue for polynomial coalgebras of Birkhoff's celebrated characterisation of equationally definable classes of abstract algebras as being those closed under homomorphic images, subalgebras, and direct products. The coalgebraic characterisation involves new notions of observational ultraproduct and ultrapower of coalgebras, obtained from the classical construction of ultraproducts by deleting states that assign “nonstandard” values to terms of observable type. A class of polynomial coalgebras is shown to be the class of all models of a set of observable formulas if, and only if, it is closed under images of bisimulation relations, disjoint unions and observational ultrapowers.Observational ultraproducts are also used to discuss compactness—which holds only under limited conditions; to characterise finitely, axiomatisable classes of polynomial coalgebras; and to show that there are axiomatisable classes that are not finitely axiomatisable. (shrink)

Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\fancyscript{L}}$$\end{document} be a finite first-order language and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle{\fancyscript{M}_n} \,|\, {n < \omega}\rangle}$$\end{document} be a sequence of finite \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\fancyscript{L}}$$\end{document}-models containing models of arbitrarily large finite cardinality. If the intersection of less than continuum-many dense open subsets of Cantor Space ω2 is non-empty, then there is a non-principal ultrafilter \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...) \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\fancyscript{U}}$$\end{document} over ω such that the corresponding ultraproduct \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\prod_\fancyscript{U}\fancyscript{M}_n}$$\end{document} has an automorphism that is not induced by an element of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\prod_{n<\omega}{\rm Aut}(\fancyscript{M}_n)}$$\end{document}. (shrink)

In [3] a certain family of topological spaces was introduced on ultraproducts. These spaces have been called ultratopologies and their definition was motivated by model theory of higher order logics. Ultratopologies provide a natural extra topological structure for ultraproducts. Using this extra structure in [3] some preservation and characterization theorems were obtained for higher order logics. The purely topological properties of ultratopologies seem interesting on their own right. We started to study these properties in [2], where some questions (...) remained open. Here we present the solutions of two such problems. More concretely we show 1. that there are sequences of finite sets of pairwise different cardinalities such that in their certain ultraproducts there are homeomorphic ultratopologies and 2. if A is an infinite ultraproduct of finite sets, then every ultratopology on A contains a dense subset D such that |D| < |A|. (shrink)

This paper investigates how naive theories of truth fare with respect to a set of extremely plausible principles of restricted quantification. It is first shown that both nonsubstructural theories as well as certain substructural theories cannot validate all those principles. Then, pursuing further an approach to the semantic paradoxes that the author has defended elsewhere, the theory of restricted quantification available in a specific naive theory that rejects the structural property of contraction is explored. It is shown that (...) the theory validates all the principles in question, and it is argued that other prima facie plausible principles that the theory fails to validate are objectionable on independent grounds. (shrink)

We study ultraproducts of finite residue rings \ where \ is a non-principal ultrafilter. We find sufficient conditions of the ultrafilter \ to determine if the resulting ultraproduct \ has simple, NIP, \ but not simple nor NIP, or \ theory, noting that all these four cases occur.

Given a simple non-trivial finite-dimensional Lie algebra L, fields $K_i$ and Chevalley groups $L(K_i)$ , we first prove that $\Pi_{\mathcal{U}} L(K_i)$ is isomorphic to $L(\Pi_{\mathcal{U}}K_i)$ . Then we consider the case of Chevalley groups of twisted type ${}^n\!L$ . We obtain a result analogous to the previous one. Given perfect fields $K_i$ having the property that any element is either a square or the opposite of a square and Chevalley groups ${}^n\!L(K_i)$ , then $\pu{}^n\!L(K_i)$ is isomorphic to ${}^n\!L(\pu K_i)$ . (...) We apply our results to prove the decidability of the set of sentences true in almost all finite groups of the form L(K) where K is a finite field and L a fixed untwisted Chevalley type. (shrink)

A quantified universe is a set M equipped with a Riesz space equation image of real functions on Mn, for each n, and a second order operation equation image. Metric structures 4, graded probability structures 9 and many other structures in analysis are examples of such universes. We define ultraproduct of quantified universes and study properties preserved by this construction. We then discuss logics defined on the basis of classes of quantified universes which are closed under this construction.

Given a convergence theorem in analysis, under very general conditions a model-theoretic compactness argument implies that there is a uniform bound on the rate of metastability. We illustrate with three examples from ergodic theory.

In [This Zeitschrift 25 , 45-52, 119-134, 447-464], Pavelka systematically discussed propositional calculi with values in enriched residuated lattices and developed a general framework for approximate reasoning. In the first part of this paper we introduce the concept of generalized quantifiers into Pavelka's logic and establish the fundamental theorem of ultraproduct in first order Pavelka's logic with generalized quantifiers. In the second part of this paper we show that the fundamental theorem of ultraproduct in first order Pavelka's logic is preserved (...) under some direct product of lattices of truth values. (shrink)

This article investigates online representations and evaluations of EU migrants, focusing on the notion of ‘benefit tourism’ and discursive strategies used in the (de)legitimization of new welfare restrictions in the UK. Through the examination of online newspapers and corresponding public comment threads, this article adopts theoretical and methodological premises from Critical Discourse Studies (CDS), drawing upon the Discourse-Historical Approach (DHA) to provide both a politically motivated as well as reflexive account. Although new participatory structures allow for resistance to emerge, the (...) openness, scalability and anonymity of the internet also allows for the spread of discrimination through the construction of EU migrants (in particular Bulgarians and Romanians) as the ‘Other’. (shrink)

1. Consistent inequality [We prove the consistency of irr $(\displaystyle\prod_{i < \kappa} B_i/D) < \displaystyle\prod_{i < \kappa}$ irr(B i )/D where D is an ultrafilter on κ and each B i is a Boolean algebra and irr(B) is the maximal size of irredundant subsets of a Boolean algebra B, see full definition in the text. This solves the last problem, 35, of this form from Monk's list of problems in [M2]. The solution applies to many other properties, e.g. Souslinity.] 2. (...) Consistency for small cardinals [We get similar results with κ=ℵ1 (easily we cannot have it for κ=ℵ0) and Boolean algebras B i (i<κ) of cardinality $< \beth_{\omega_1}$ .] This article continues Magidor Shelah [MgSh:433] and Shelah Spinas [ShSi:677], but does not rely on them: see [M2] for the background. (shrink)

This dissertation investigates the ways in which natural language restricts the domains of quantifiers. Adverbs of quantification are analyzed as quantifying over situations. The domain of quantifiers is pragmatically constrained: apparent processes of "semantic partition" are treated as pragmatic epiphenomena. The introductory Chapter 1 sketches some of the background of work on natural language quantification and begins the analysis of adverbial quantification over situations. Chapter 2 develops the central picture of "semantic partition" as a side-effect of pragmatic processes of anaphora (...) resolution. I argue that the apparent effects of topic/focus articulation and presuppositional information on the interpretation of quantifiers are not the result of a direct and local mechanism of sentence grammar. Instead, I develop an analysis where the link is established via the anaphoric dependence of quantifier domains on the discourse context. Chapter 3 discusses the analysis of conditional clauses as quantifier restrictors, concentrating on the question whether conditional clauses restrict quantifiers directly or indirectly. A treatment is explored which has if-clauses constrain the value of the hidden domain variable of the restricted quantifier. Chapter 4, on unless-clauses, and Chapter 5, on only if- and even if-clauses, present some issues in the compositional analysis of complex conditional clauses. These chapters significantly expand the data coverage of the theory of A-quantification. Building on previous work of mine on exceptives, I analyze unless-clauses as exceptive operators on A-quantifiers. The analysis of only if-clauses, treated as conditional clauses that combine if with the focus adverb only, unearthes some interesting new properties. Chapter 6, finally, examines the phenomenon of donkey-anaphora in the light of the results of the previous chapters. I show that a solution to the proportion problem may become possible once we combine the situation-semantic approach to adverbial quantification with the pragmatic theory developed in Chapter 2 and further elaborated in the analysis of donkey anaphora in complex conditionals. (shrink)

Maddy gave a semi-formal account of restrictiveness by defining a formal notion based on a class of interpretations and explaining how to handle false positives and false negatives. Recently, Hamkins pointed out some structural issues with Maddy's definition. We look at Maddy's formal definitions from the point of view of an abstract interpretation relation. We consider various candidates for this interpretation relation, including one that is close to Maddy's original notion, but fixes the issues raised by Hamkins. Our work brings (...) to light additional structural issues that we also discuss. (shrink)

There have been two main lines in the literature on restricted games: the first line was started by Myerson (1977) that studied graph-restricted games an the second one was initiated by Faigle (1989). The present paper provides a unified way to look on the literature and establishes connections between the two different lines on restricted games. The strength and advantages of this unified approach becomes clear in the study of the inheritance of the convexity from the game (...) to the restricted game where an interesting result by Nouweland and Borm (1991) on the convexity of graph-restricted games is turned into a direct consequence of the corresponding result by Faigle (1989), by means of this relation. (shrink)

This study continues the anti-realist’s quest for a principled way to avoid Fitch’s paradox. It is proposed that the Cartesian restriction on the anti-realist’s knowability principle ‘ϕ, therefore 3Kϕ’ should be formulated as a consistency requirement not on the premise ϕ of an application of the rule, but rather on the set of assumptions on which the relevant occurrence of ϕ depends. It is stressed, by reference to illustrative proofs, how important it is to have proofs in normal form before (...) applying the proposed restriction. A similar restriction is proposed for the converse inference, the so-called Rule of Factiveness ‘3Kϕ therefore ϕ’. The proposed restriction appears to block another Fitch-style derivation that uses the KK -thesis in order to get around.. (shrink)

We redefine a system of varieties definable by a schema of equations to include finite dimensions. Then we present a technique using ultraproducts enabling one to lift results proved for every finite dimension to the transfinite. Let $\bf Ord$ denote the class of all ordinals. Let $\langle \mathbf{K}_{\alpha}: \alpha\in \bf Ord\rangle$ be a system of varieties definable by a schema. Given any ordinal $\alpha$, we define an operator $\mathsf{Nr}_{\alpha}$ that acts on $\mathbf{K}_{\beta}$ for any $\beta>\alpha$ giving an algebra in (...) $\mathbf{K}_{\alpha}$, as an abstraction of taking $\alpha$-neat reducts for cylindric algebras. We show that for any positive $k$, and any infinite ordinal $\alpha$ that $\mathbf{S}\mathsf{Nr}_{\alpha}\mathbf{K}_{\alpha+k+1}$ cannot be axiomatized by a finite schema over $\mathbf{S}\mathsf{Nr}_{\alpha}\mathbf{K}_{\alpha+k}$ given that the result is valid for all finite dimensions greater than some fixed finite ordinal. We apply our results to cylindric algebras and Halmos quasipolyadic algebras with equality. As an application to our algebraic result we obtain a strong incompleteness theorem (in the sense that validitities are not captured by finitary Hilbert style axiomatizations) for an algebraizable extension of $L_{\omega,\omega}$. (shrink)

Abortion restrictions are particularly good for black women—at least in the United States. This claim will likely strike many as outlandish. And numerous commentaries on abortion restrictions have suggested otherwise: many authors have lamented the effects of abortion restrictions on women, and black women in particular—these restrictions are bad for them, these authors say. However, abortion restrictions are clearly good for black women. This is because if someone is prevented from performing a morally wrong action, it’s good for her. For (...) example, it’s good for Sarah if she’s prevented from driving home drunk. However, since abortion is morally wrong, it follows that it’s good for women when they are prevented from getting an abortion. And since black women get abortions at disproportionately high rates, abortion restrictions are good in particular for black women. Indeed, this is an example of a positive effect of intersectionality. [lightly updated in light of it being rescinded.]. (shrink)

The use of patient restrictions (e.g. involuntary admission, seclusion, restraint) is a complex ethical dilemma in psychiatric care. The present study explored nurses’ (n = 22) and physicians’ (n = 5) perceptions of what actually happens when an aggressive behaviour episode occurs on the ward and what alternatives to seclusion and restraint are actually in use as normal standard practice in acute psychiatric care. The data were collected by focus group interviews and analysed by inductive content analysis. The participants believed (...) that the decision-making process for managing patients’ aggressive behaviour contains some in-built ethical dilemmas. They thought that patients’ subjective perspective received little attention. Nevertheless, the staff proposed and appeared to use a number of alternatives to minimize or replace the use of seclusion and restraint. Medical and nursing staff need to be encouraged and taught to: (1) tune in more deeply to reasons for patients’ aggressive behaviour; and (2) use alternatives to seclusion and restraint in order to humanize patient care to a greater extent. (shrink)

Non-archimedean models of the theory of the real ordered field with restricted analytic functions may not support a total exponential function, but they always have partial exponentials defined in certain convex subrings. On face of this, we study the first order theory of non-archimedean ordered valued fields with all restricted analytic functions and an exponential function defined in the valuation ring, which extends the restricted analytic exponential. We obtain model completeness and other desirable properties for this theory. (...) In particular, any model embeds in a model where the partial exponential extends to a total one. (shrink)

The combinatory restriction known in linguistics as ‘selection restrictions’ are generally assumed to be a kind of linguistic structures, either syntactic or semantic, or at best cognitive structures. The idea discussed in this paper is that selection restrictions, although relevant for the description of complex meanings of linguistic expressions, do not belong to the structure of either language or cognition in any reasonable sense. Instead, they are criteria for conceptual consistency. They form a layer of shared presuppositions that lie at (...) the grounds of consistent human behaviour and therefore of consistent thought and expression and belong to a natural ontology shared far beyond the boundaries of a given linguistic community. (shrink)

In this paper I present a range of substructural logics for a conditional connective ↦. This connective was original introduced semantically via restriction on the ternary accessibility relation R for a relevant conditional. I give sound and complete proof systems for a number of variations of this semantic definition. The completeness result in this paper proceeds by step-by-step improvements of models, rather than by the one-step canonical model method. This gradual technique allows for the additional control, lacking in the canonical (...) model method, that is required. (shrink)

The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.

Let’s begin with a simple example. Consider two quarks: one near the tip of your nose, the other near the center of Alpha Centauri. Here is a question about these two subatomic particles: Is there an object that has these two quarks as its parts and that has no other parts? According to one view of the matter (a view that is surprisingly endorsed by a great many contemporary philosophers), the answer to this question is Yes. But I think it (...) is fair to say that according to common sense, the answer to this question is really No, there is no object that has as its only two parts a quark near the tip of your nose and another quark near the center of Alpha Centauri. (shrink)

This paper investigates the meaning of restricted quantification when the embedded conditional is taken as the conditional of some first-order connexive logics. The study is carried out by checking the suitability of RQ for defining a connexive class theory, in analogy to the definition of Boolean class theory by using RQ in classical logic. Negative results are obtained for Wansing’s first-order connexive logic QC and one variant of Priest’s first-order connexive logic QP. A positive result is obtained for another (...) variant of QP. (shrink)

Recently, several philosophers have moved from a classical account of divine omniscience according to which God knows all truths to a restricted account of divine omniscience according to which God knows all knowable truths. But an important objection offered by Alexander Pruss threatens to show that if God knows all knowable truths, God must also know all truths. In this paper, I show that there is a way out of Pruss’s objection for the advocate of restricted omniscience if (...) she will define her view in terms of ways of knowing rather than in terms of logical possibilities. (shrink)