On the category of models of a complete theory

1982 ◽  
Vol 47 (2) ◽  
pp. 249-266 ◽  
Author(s):  
Daniel Lascar
Keyword(s):  
The Other ◽  
Complete Theory ◽  
Semi Group ◽  
Group Of Automorphisms ◽  
Infinite Sets ◽  
Image Position ◽  
The Given

Let T be a countable complete theory and C(T) the category whose objects are the models of T and morphisms are the elementary maps. The main object of this paper will be the study of C(T). The idea that a better understanding of the category may give us model theoretic information about T is quite natural: The (semi) group of automorphisms (endomorphisms) of a given structure is often a powerful tool for studying this structure. But certainly, one of the very first questions to be answered is: “to what extent does this category C(T) determine T?”There is some obvious limitation: for example let T0 be the theory of infinite sets (in a language containing only =) and T1 the theory, in the language ( =, U(ν0),f(ν0)) stating that:(1) U is infinite.(2)f is a bijective map from U onto its complement.It is quite easy to see that C(T0) is equivalent to C(T1). But, in this case, T0 and T1 can be “interpreted” each in the other. To make this notion of interpretation precise, we shall associate with each theory T a category, loosely denoted by T, defined as follows:(1) The objects are the formulas in the given language.(2) The morphisms from into are the formulas such that(i.e. f defines a map from ϕ into ϕ; two morphisms defining the same map in all models of T should be identified).

scholarly journals BINARY PRIMITIVE HOMOGENEOUS SIMPLE STRUCTURES

2017 ◽  
Vol 82 (1) ◽  
pp. 183-207 ◽  
Author(s):  
VERA KOPONEN
Keyword(s):  
Algebraic Closure ◽  
The Other ◽  
Equivalence Relations ◽  
Complete Theory ◽  
Future Research ◽  
Random Structure ◽  
Homogeneous Structures ◽  
Image Position

AbstractSuppose that ${\cal M}$ is countable, binary, primitive, homogeneous, and simple. We prove that the SU-rank of the complete theory of ${\cal M}$ is 1 and hence 1-based. It follows that ${\cal M}$ is a random structure. The conclusion that ${\cal M}$ is a random structure does not hold if the binarity condition is removed, as witnessed by the generic tetrahedron-free 3-hypergraph. However, to show that the generic tetrahedron-free 3-hypergraph is 1-based requires some work (it is known that it has the other properties) since this notion is defined in terms of imaginary elements. This is partly why we also characterize equivalence relations which are definable without parameters in the context of ω-categorical structures with degenerate algebraic closure. Another reason is that such characterizations may be useful in future research about simple (nonbinary) homogeneous structures.

The acquisition of Hungarian recursive PPs

2018 ◽  
Vol 4 (1) ◽  
pp. 105-123
Author(s):  
Ágnes Langó-Tóth
Keyword(s):  
Language Acquisition ◽  
Functional Element ◽  
The Other ◽  
Functional Head ◽  
Experiment Subject ◽  
The Given

Abstract In this study an experiment is presented on how Hungarian children interpret two word orders of recursive PPs (subject-PP-verb and PP-subject-verb order). According to the research of Roeper (2011) and Hollebrandse and Roeper (2014), children tend to give conjunctive interpretation to multiple embedded sentences at the beginning of language acquisition. This interpretation later turns into an adult-like, recursive interpretation. Our aim is to discover (i) whether Hungarian children start with conjunction as well, and whether (ii) the apparently more salient functional head lévő appearing in Hungarian recursive PPs can help them to acquire the correct, recursive interpretation early. We also want to find out whether (iii) the word orders in recursive PPs have an influence on the acquisition of children. In this paper two experiments are presented conducted with 6 and 8-year-olds and adults, in which the participants were asked to choose between two pictures. One of the pictures depicted recursive and the other one depicted conjunctive interpretation of the given sentence. In the first experiment subject-PP-verb order was tested, but in the second one sentences were tested with PP-subject-verb order. We will claim that lévő, which is (arguably) a more salient Hungarian functional element than -i, does not help children to acquire the embedded reading of recursive sentences, because both of them are overt functional heads. However, the two types of word orders affect the acquisition of recursive PPs. PP-subject-verb order is easier to compute because the order of the elements in the sentences and the order of the elements in the pictures matches.

Growth Characteristics of Activated Sludges Acclimated to para-Nitrophenol in Batch and Continuous Modes

1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa
Keyword(s):  
Growth Characteristics ◽  
The Other ◽  
Operational Mode ◽  
Continuous Mode ◽  
Relative Resistance ◽  
Batch Mode ◽  
The Given ◽  
Operational Modes ◽  
Very High ◽  
Sensitive Group

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.

Giving and Promising

2018 ◽  
Author(s):  
Jean-Yves Lacoste ◽  
Oliver O’Donovan
Keyword(s):  
The Other ◽  
Face To Face ◽  
Present Experience ◽  
The World ◽  
The Given

Giving and promise must be thought together. Being-in-the world entails being-with the other, who is both “given” and bearer of a gift promised. But any disclosure may be understood as a gift; it is not anthropomorphic to speak of “self-giving” with a wider reference than person-to-person disclosure. Which implies that no act of giving can exhaust itself in its gift. Present experience never brings closure to self-revealing. Yet giving is crystallized into “the given,” the closure of gift. “The given” is what it is, needing no gift-event to reveal it. But the given, too, is precarious, and can be destabilized when giving brings us face to face with something unfamiliar. Nothing appears without a promise of further appearances, and God himself can never be “given.”

scholarly journals XXV.—The Generating Function of the Reciprocal of a Determinant

1905 ◽  
Vol 40 (3) ◽  
pp. 615-629
Author(s):  
Thomas Muir
Keyword(s):  
Generating Function ◽  
Specific Character ◽  
Partial Fraction ◽  
Homogeneous Functions ◽  
Series Form ◽  
General Proposition ◽  
In Series ◽  
Image Position ◽  
The Given

(1) This is a subject to which very little study has been directed. The first to enunciate any proposition regarding it was Jacobi; but the solitary result which he reached received no attention from mathematicians,—certainly no fruitful attention,—during seventy years following the publication of it.Jacobi was concerned with a problem regarding the partition of a fraction with composite denominator (u1 − t1) (u2 − t2) … into other fractions whose denominators are factors of the original, where u1, u2, … are linear homogeneous functions of one and the same set of variables. The specific character of the partition was only definable by viewing the given fraction (u1−t1)−1 (u2−t2)−1…as expanded in series form, it being required that each partial fraction should be the aggregate of a certain set of terms in this series. Of course the question of the order of the terms in each factor of the original denominator had to be attended to at the outset, since the expansion for (a1x+b1y+c1z−t)−1 is not the same as for (b1y+c1z+a1x−t)−1. Now one general proposition to which Jacobi was led in the course of this investigation was that the coefficient ofx1−1x2−1x3−1…in the expansion ofy1−1u2−1u3−1…, whereis |a1b2c3…|−1, provided that in energy case the first term of uris that containing xr.

scholarly journals The Dissociation of the Compound of Iodine and Thio-urea

1904 ◽  
Vol 24 ◽  
pp. 233-239 ◽  
Author(s):  
Hugh Marshall
Keyword(s):  
Nitric Acid ◽  
General Formula ◽  
Free Acid ◽  
The Other ◽  
Image Position

When thio-urea is treated with suitable oxidising agents in presence of acids, salts are formed corresponding to the general formula (CSN2H4)2X2:—Of these salts the di-nitrate is very sparingly soluble, and is precipitated on the addition of nitric acid or a nitrate to solutions of the other salts. The salts, as a class, are not very stable, and their solutions decompose, especially on warming, with formation of sulphur, thio-urea, cyanamide, and free acid. A corresponding decomposition results immediately on the addition of alkali, and this constitutes a very characteristic reaction for these salts.

Extremely undecidable sentences

1982 ◽  
Vol 47 (1) ◽  
pp. 191-196 ◽  
Author(s):  
George Boolos
Keyword(s):  
Modal Logic ◽  
The Other ◽  
Propositional Modal Logic ◽  
Image Position

Let ‘ϕ’, ‘χ’, and ‘ψ’ be variables ranging over functions from the sentence letters P0, P1, … Pn, … of (propositional) modal logic to sentences of P(eano) Arithmetic), and for each sentence A of modal logic, inductively define Aϕ by[and similarly for other nonmodal propositional connectives]; andwhere Bew(x) is the standard provability predicate for PA and ⌈F⌉ is the PA numeral for the Gödel number of the formula F of PA. Then for any ϕ, (−□⊥)ϕ = −Bew(⌈⊥⌉), which is the consistency assertion for PA; a sentence S is undecidable in PA iff both and , where ϕ(p0) = S. If ψ(p0) is the undecidable sentence constructed by Gödel, then ⊬PA (−□⊥→ −□p0 & − □ − p0)ψ and ⊢PA(P0 ↔ −□⊥)ψ. However, if ψ(p0) is the undecidable sentence constructed by Rosser, then the situation is the other way around: ⊬PA(P0 ↔ −□⊥)ψ and ⊢PA (−□⊥→ −□−p0 & −□−p0)ψ. We call a sentence S of PA extremely undecidable if for all modal sentences A containing no sentence letter other than p0, if for some ψ, ⊬PAAψ, then ⊬PAAϕ, where ϕ(p0) = S. (So, roughly speaking, a sentence is extremely undecidable if it can be proved to have only those modal-logically characterizable properties that every sentence can be proved to have.) Thus extremely undecidable sentences are undecidable, but neither the Godel nor the Rosser sentence is extremely undecidable. It will follow at once from the main theorem of this paper that there are infinitely many inequivalent extremely undecidable sentences.

On functional Nörlund methods

1970 ◽  
Vol 67 (1) ◽  
pp. 47-60 ◽  
Author(s):  
B. Choudhary
Keyword(s):  
The Other ◽  
Integral Transformations ◽  
Other Hand ◽  
Nörlund Means ◽  
The One ◽  
Image Position

Integral transformations analogous to the Nörlund means have been introduced and investigated by Kuttner, Knopp and Vanderburg(6), (5), (4). It is known that with any regular Nörlund mean (N, p) there is associated a functionregular for |z| < 1, and if we have two Nörlund means (N, p) and (N, r), where (N, pr is regular, while the function is regular for |z| ≤ 1 and different) from zero at z = 1, then q(z) = r(z)p(z) belongs to a regular Nörlund mean (N, q). Concerning Nörlund means Peyerimhoff(7) and Miesner (3) have recently obtained the relation between the convergence fields of the Nörlund means (N, p) and (N, r) on the one hand and the convergence field of the Nörlund mean (N, q) on the other hand.

Development of Advanced CNC Interpolation Algorithm With Consideration of Command and Dynamic Errors

2015 ◽  
Author(s):  
Meng-Shiun Tsai ◽  
Ying-Che Huang
Keyword(s):  
The Other ◽  
Contour Error ◽  
Interpolation Algorithm ◽  
Interpolation Scheme ◽  
Error Equation ◽  
The Past ◽  
Cnc Interpolation ◽  
Dynamic Errors ◽  
Simulation Results ◽  
The Given

In this paper, an integrated acceleration/deceleration with dynamics interpolation scheme is proposed to confine the maximum contour error at the junction of linear junction. The dynamic contour error equation is derived analytically and then it is utilized for the interpolation design. Based on the derived formulations which could predict the command and dynamic errors, the advanced interpolation design could adjust the connecting velocity of the two blocks to confine the overall contour errors under the given tolerance. Simulation results validate the proposed algorithm can achieve higher accurate trajectory as compared to the other interpolation algorithm proposed in the past.

scholarly journals Distribution of rational points on the real line

1973 ◽  
Vol 15 (2) ◽  
pp. 243-256 ◽  
Author(s):  
T. K. Sheng
Keyword(s):  
Algebraic Number ◽  
Rational Number ◽  
Real Line ◽  
Rational Points ◽  
The Other ◽  
Liouville Numbers ◽  
The Real ◽  
Other Hand ◽  
Image Position

It is well known that no rational number is approximable to order higher than 1. Roth [3] showed that an algebraic number is not approximable to order greater than 2. On the other hand it is easy to construct numbers, the Liouville numbers, which are approximable to any order (see [2], p. 162). We are led to the question, “Let Nn(α, β) denote the number of distinct rational points with denominators ≦ n contained in an interval (α, β). What is the behaviour of Nn(α, + 1/n) as α varies on the real line?” We shall prove that and that there are “compressions” and “rarefactions” of rational points on the real line.

Sign in / Sign up

Export Citation Format

Share Document