QE commutative nilrings

1984 ◽  
Vol 49 (2) ◽  
pp. 644-651 ◽  
Author(s):  
D. Saracino ◽  
C. Wood
Keyword(s):  
Classification Problem ◽  
Commutative Rings ◽  
Point Of View ◽  
Negative Evidence ◽  
Characteristic P ◽  
Locally Finite ◽  
First Order ◽  
Order Language ◽  
Algebraic Description ◽  
Countably Infinite

If L is a first-order language, then an L-structure A is called quantifier-eliminable (QE) if every L-formula is equivalent in A to a formula without quantifiers.The classification problem for QE groups and rings has received attention in work by Berline, Boffa, Cherlin, Feigner, Macintyre, Point, Rose, the present authors, and others. In [1], Berline and Cherlin reduced the problem for rings of prime characteristic p to that for nilrings, but also constructed countable QE nilrings of characteristic p. Likewise, in [3], we constructed countable QE nil-2 groups. Both results can be viewed as “nonstructure theorems”, in that they provide negative evidence for any attempt at classification. In the present paper we show that the situation is equally bad (or rich, depending on one's point of view) for commutative rings:Theorem 1. For any odd prime p, there existcountable QE commutative nilrings of characteristic p.This solves a problem posed in [1]. We remark that the examples we produce are uniformly locally finite, hence ℵ0-categorical. A more algebraic description is that each of our rings R is uniformly locally finite (in fact, R3 = 0) and homogeneous, in the sense that any isomorphism of finitely generated subrings extends to an automorphism of R.Theorem 1 does not cover the case p = 2, and we show that for commutative rings this case is in fact exceptional:Theorem 2. There exist exactly two nonisomorphic countably infinite QE commutative nilrings of characteristic 2.

Locally finite theories

1986 ◽  
Vol 51 (1) ◽  
pp. 59-62 ◽  
Author(s):  
Jan Mycielski
Keyword(s):  
Main Idea ◽  
Order Theory ◽  
Interpolation Theorem ◽  
Point Of View ◽  
Finite Model ◽  
Consistent Theory ◽  
Locally Finite ◽  
First Order ◽  
First Order Theory ◽  
Finite Theory

We say that a first order theoryTislocally finiteif every finite part ofThas a finite model. It is the purpose of this paper to construct in a uniform way for any consistent theoryTa locally finite theory FIN(T) which is syntactically (in a sense) isomorphic toT.Our construction draws upon the main idea of Paris and Harrington [6] (I have been influenced by some unpublished notes of Silver [7] on this subject) and generalizes the syntactic aspect of their result from arithmetic to arbitrary theories. (Our proof is syntactic, and it is simpler than the proofs of [5], [6] and [7]. This reminds me of the simple syntactic proofs of several variants of the Craig-Lyndon interpolation theorem, which seem more natural than the semantic proofs.)The first mathematically strong locally finite theory, called FIN, was defined in [1] (see also [2]). Now we get much stronger ones, e.g. FIN(ZF).From a physicalistic point of view the theorems of ZF and their FIN(ZF)-counterparts may have the same meaning. Therefore FIN(ZF) is a solution of Hilbert's second problem. It eliminates ideal (infinite) objects from the proofs of properties of concrete (finite) objects.In [4] we will demonstrate that one can develop a direct finitistic intuition that FIN(ZF) is locally finite. We will also prove a variant of Gödel's second incompleteness theorem for the theory FIN and for all its primitively recursively axiomatizable consistent extensions.The results of this paper were announced in [3].

Semantics of the infinitistic rules of proof

1976 ◽  
Vol 41 (1) ◽  
pp. 121-138
Author(s):  
Krzysztof Rafal Apt
Keyword(s):  
Completeness Theorem ◽  
Recursion Theory ◽  
Point Of View ◽  
First Order ◽  
Order Language ◽  
The Subject ◽  
Order Arithmetic ◽  
Additional Rule ◽  
First Time ◽  
Further Development

This paper is devoted to the study of the infinitistic rules of proof i.e. those which admit an infinite number of premises. The best known of these rules is the ω-rule. Some properties of the ω-rule and its connection with the ω-models on the basis of the ω-completeness theorem gave impulse to the development of the theory of models for admissible fragments of the language . On the other hand the study of representability in second order arithmetic with the ω-rule added revealed for the first time an analogy between the notions of re-cursivity and hyperarithmeticity which had an important influence on the further development of generalized recursion theory.The consideration of the subject of infinitistic rules in complete generality seems to be reasonable for several reasons. It is not completely clear which properties of the ω-rule were essential for the development of the above-mentioned topics. It is also worthwhile to examine the proof power of infinitistic rules of proof and what distinguishes them from finitistic rules of proof.What seemed to us the appropriate point of view on this problem was the examination of the connection between the semantics and the syntax of the first order language equipped with an additional rule of proof.

Some characterization theorems for infinitary universal Horn logic without equality

1996 ◽  
Vol 61 (4) ◽  
pp. 1242-1260 ◽  
Author(s):  
Pilar Dellunde ◽  
Ramon Jansana
Keyword(s):  
Algebraic Logic ◽  
Point Of View ◽  
Abstract Algebraic Logic ◽  
Relation Symbol ◽  
Horn Logic ◽  
First Order ◽  
Order Language ◽  
Unary Relation ◽  
Theoretic Point ◽  
Horn Fragment

In this paper we mainly study preservation theorems for two fragments of the infinitary languages Lκκ, with κ regular, without the equality symbol: the universal Horn fragment and the universal strict Horn fragment. In particular, when κ is ω, we obtain the corresponding theorems for the first-order case.The universal Horn fragment of first-order logic (with equality) has been extensively studied; for references see [10], [7] and [8]. But the universal Horn fragment without equality, used frequently in logic programming, has received much less attention from the model theoretic point of view. At least to our knowledge, the problem of obtaining preservation results for it has not been studied before by model theorists. In spite of this, in the field of abstract algebraic logic we find a theorem which, properly translated, is a preservation result for the strict universal Horn fragment of infinitary languages without equality which, apart from function symbols, have only a unary relation symbol. This theorem is due to J. Czelakowski; see [5], Theorem 6.1, and [6], Theorem 5.1. A. Torrens [12] also has an unpublished result dealing with matrices of sequent calculi which, properly translated, is a preservation result for the strict universal Horn fragment of a first-order language. And in [2] of W. J. Blok and D. Pigozzi we find Corollary 6.3 which properly translated corresponds to our Corollary 19, but for the case of a first-order language that apart from its function symbols has only one κ-ary relation symbol, and for strict universal Horn sentences. The study of these results is the basis for the present work. In the last part of the paper, Section 4, we will make these connections clear and obtain some of these results from our theorems. In this way we hope to make clear two things: (1) The field of abstract algebraic logic can be seen, in part, as a disguised study of universal Horn logic without equality and so has an added interest. (2) A general study of universal Horn logic without equality from a model theoretic point of view can be of help in the field of abstract algebraic logic.

scholarly journals The Road to Modern Logic—An Interpretation

2001 ◽  
Vol 7 (4) ◽  
pp. 441-484 ◽  
Author(s):  
José Ferreirós
Keyword(s):  
Order Logic ◽  
Point Of View ◽  
First Order Logic ◽  
Theoretical Point ◽  
Primary Role ◽  
Philosophical Discussion ◽  
Modern Logic ◽  
Core System ◽  
First Order ◽  
The Road

AbstractThis paper aims to outline an analysis and interpretation of the process that led to First-Order Logic and its consolidation as a core system of modern logic. We begin with an historical overview of landmarks along the road to modern logic, and proceed to a philosophical discussion casting doubt on the possibility of a purely rational justification of the actual delimitation of First-Order Logic. On this basis, we advance the thesis that a certain historical tradition was essential to the emergence of modern logic; this traditional context is analyzed as consisting in some guiding principles and, particularly, a set of exemplars (i.e., paradigmatic instances). Then, we proceed to interpret the historical course of development reviewed in section 1, which can broadly be described as a two-phased movement of expansion and then restriction of the scope of logical theory. We shall try to pinpoint ambivalencies in the process, and the main motives for subsequent changes. Among the latter, one may emphasize the spirit of modern axiomatics, the situation of foundational insecurity in the 1920s, the resulting desire to find systems well-behaved from a proof-theoretical point of view, and the metatheoretical results of the 1930s. Not surprisingly, the mathematical and, more specifically, the foundational context in which First-Order Logic matured will be seen to have played a primary role in its shaping.Mathematical logic is what logic, through twenty-five centuries and a few transformations, has become today. (Jean van Heijenoort)

Weakly atomic-compact relational structures

1971 ◽  
Vol 36 (1) ◽  
pp. 129-140 ◽  
Author(s):  
G. Fuhrken ◽  
W. Taylor
Keyword(s):  
Abelian Group ◽  
Model Theory ◽  
Compact Abelian Group ◽  
Finite Subset ◽  
Relational Structure ◽  
Similarity Type ◽  
First Order ◽  
Relational Structures ◽  
Order Language ◽  
Weakly Atomic

A relational structure is called weakly atomic-compact if and only if every set Σ of atomic formulas (taken from the first-order language of the similarity type of augmented by a possibly uncountable set of additional variables as “unknowns”) is satisfiable in whenever every finite subset of Σ is so satisfiable. This notion (as well as some related ones which will be mentioned in §4) was introduced by J. Mycielski as a generalization to model theory of I. Kaplansky's notion of an algebraically compact Abelian group (cf. [5], [7], [1], [8]).

Note on Interference Effects in Two-Step Reaction Processes

1975 ◽  
Vol 53 (23) ◽  
pp. 2590-2592
Author(s):  
J. Cejpek ◽  
J. Dobeš
Keyword(s):  
Perturbation Theory ◽  
Point Of View ◽  
Order Perturbation ◽  
Interference Effects ◽  
Qualitative Explanation ◽  
First Order ◽  
One Step ◽  
Step Transition ◽  
Reaction Processes ◽  
First Order Perturbation

The reaction processes in which a one-step transition is forbidden are analyzed from the point of view of the first order perturbation theory. The interference between two competing two-step reaction paths is found to be always constructive. A qualitative explanation of the experimentally observed reaction intensities is presented.

scholarly journals ON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURES

2016 ◽  
Vol 81 (3) ◽  
pp. 951-971
Author(s):  
NADAV MEIR
Keyword(s):  
New Products ◽  
Elementary Substructure ◽  
First Order ◽  
Order Language ◽  
Image Position

AbstractWe say a structure ${\cal M}$ in a first-order language ${\cal L}$ is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure ${\cal M}\prime \subseteq {\cal M}$ such that ${\cal M}\prime \cong {\cal M}$. Additionally, we say that ${\cal M}$ is symmetrically indivisible if ${\cal M}\prime$ can be chosen to be symmetrically embedded in ${\cal M}$ (that is, every automorphism of ${\cal M}\prime$ can be extended to an automorphism of ${\cal M}$). Similarly, we say that ${\cal M}$ is elementarily indivisible if ${\cal M}\prime$ can be chosen to be an elementary substructure. We define new products of structures in a relational language. We use these products to give recipes for construction of elementarily indivisible structures which are not transitive and elementarily indivisible structures which are not symmetrically indivisible, answering two questions presented by A. Hasson, M. Kojman, and A. Onshuus.

scholarly journals Virtual Element Method for the Laplace-Beltrami equation on surfaces

2018 ◽  
Vol 52 (3) ◽  
pp. 965-993 ◽  
Author(s):  
Massimo Frittelli ◽  
Ivonne Sgura
Keyword(s):  
Numerical Experiments ◽  
Beltrami Equation ◽  
Convergence Result ◽  
Point Of View ◽  
Polygonal Approximation ◽  
Virtual Element Method ◽  
Element Space ◽  
First Order ◽  
Virtual Element ◽  
Element Method

We present and analyze a Virtual Element Method (VEM) for the Laplace-Beltrami equation on a surface in ℝ3, that we call Surface Virtual Element Method (SVEM). The method combines the Surface Finite Element Method (SFEM) (Dziuk, Eliott, G. Dziuk and C.M. Elliott., Acta Numer. 22 (2013) 289–396.) and the recent VEM (Beirão da Veiga et al., Math. Mod. Methods Appl. Sci. 23 (2013) 199–214.) in order to allow for a general polygonal approximation of the surface. We account for the error arising from the geometry approximation and in the case of polynomial order k = 1 we extend to surfaces the error estimates for the interpolation in the virtual element space. We prove existence, uniqueness and first order H1 convergence of the numerical solution.We highlight the differences between SVEM and VEM from the implementation point of view. Moreover, we show that the capability of SVEM of handling nonconforming and discontinuous meshes can be exploited in the case of surface pasting. We provide some numerical experiments to confirm the convergence result and to show an application of mesh pasting.

scholarly journals Word order in Latin locative constructions: a corpus study in Caesar’s De bello gallico

2011 ◽  
Vol 64 (2) ◽  
Author(s):  
Stavros Skopeteas
Keyword(s):  
Word Order ◽  
Information Structure ◽  
Motion Verbs ◽  
Structural Domains ◽  
Corpus Study ◽  
First Order ◽  
Order Language ◽  
Free Word

AbstractClassical Latin is a free word order language, i.e., the order of the constituents is determined by information structure rather than by syntactic rules. This article presents a corpus study on the word order of locative constructions and shows that the choice between a Theme-first and a Locative-first order is influenced by the discourse status of the referents. Furthermore, the corpus findings reveal a striking impact of the syntactic construction: complements of motion verbs do not have the same ordering preferences with complements of static verbs and adjuncts. This finding supports the view that the influence of discourse status on word order is indirect, i.e., it is mediated by information structural domains.

Higher-Order Multilevel Solvers for the EHL Line and Point Contact Problem

1994 ◽  
Vol 116 (4) ◽  
pp. 741-750 ◽  
Author(s):  
C. H. Venner
Keyword(s):  
Contact Problem ◽  
Computing Time ◽  
Point Contact ◽  
Higher Order ◽  
Second Order ◽  
Point Of View ◽  
First Order ◽  
Fundamental Point ◽  
Numerical Solver ◽  
Circular Contact

This paper addresses the development of efficient numerical solvers for EHL problems from a rather fundamental point of view. A work-accuracy exchange criterion is derived, that can be interpreted as setting a limit to the price paid in terms of computing time for a solution of a given accuracy. The criterion can serve as a guideline when reviewing or selecting a numerical solver and a discretization. Earlier developed multilevel solvers for the EHL line and circular contact problem are tested against this criterion. This test shows that, to satisfy the criterion a second-order accurate solver is needed for the point contact problem whereas the solver developed earlier used a first-order discretization. This situation arises more often in numerical analysis, i.e., a higher order discretization is desired when a lower order solver already exists. It is explained how in such a case the multigrid methodology provides an easy and straightforward way to obtain the desired higher order of approximation. This higher order is obtained at almost negligible extra work and without loss of stability. The approach was tested out by raising an existing first order multilevel solver for the EHL line contact problem to second order. Subsequently, it was used to obtain a second-order solver for the EHL circular contact problem. Results for both the line and circular contact problem are presented.

Sign in / Sign up

Export Citation Format

Share Document