Results 271 to 280 of about 213,974 (315)

Partial Ordering in the Theory of Martingales

The Annals of Mathematics, 1955
In keeping with our general approach to the concept of a stochastic process we will put definitions and first facts pertaining to J. L. Doob's semi-martingales into rather general settings, and the purpose in so doing is to clarify and simplify rather than to generalize.
openaire   +2 more sources

Some questions of the theory of partially ordered groups

Algebra and Logic, 1983
The main results of this paper are as follows. It is proved that in each \(\ell\)-group there exists a largest convex locally nilpotent \(\ell\)- subgroup. There is constructed a linearly orderable group G having a subgroup H of finite index with a nilpotent commutant such that the commutant of G fails to be nilpotent. A partial solution of question 12
openaire   +1 more source

Partial Order Theory Applied to QSPR-QSAR Studies

Combinatorial Chemistry & High Throughput Screening, 2008
There exists a great amount of information on ranking methods provided in the literature, a new appealing methodology that is generally dealt in a so mathematical fashion. Ranking strategies are applied in a wide range of scientific fields, such as Decision Support, Toxicology, Environmental Research, Analytical Chemistry, Food Chemistry, QSPR-QSAR ...
Pablo R, Duchowicz, Eduardo A, Castr
openaire   +2 more sources

Two-dimensional partial orderings: Recursive model theory

Journal of Symbolic Logic, 1980
In this paper and the companion paper [9] we describe a number of contrasts between the theory of linear orderings and the theory of two-dimensional partial orderings.The notion of dimensionality for partial orderings was introduced by Dushnik and Miller [3], who defined a partial ordering 〈A, R〉 to be n-dimensional if there are n linear orderings of A,
Alfred B. Manaster, Joseph G. Rosenstein
openaire   +2 more sources

Partial-correctness theories as first-order theories

1985
We show that any predicate transformer is rendered (semantically) by a first-order theory, provided it is propositionally closed, i.e. closed under the rules of Consequence, Conjunction and Disjunction.
openaire   +1 more source

The Model Completion of the Theory of All Partially Ordered Sets

Mathematical Logic Quarterly, 1989
We show that the Albert-Burris's proof of finite axiomatization of existentially closed posets [\textit{M. H. Albert} and \textit{S. N. Burris}, Order 3, 169-178 (1986; Zbl 0611.03013)] gives a counterexample for one of Schmerl's conjectures [\textit{J. H. Schmerl}, J. Symb.
openaire   +2 more sources

Outline of a Theory of Partially Ordered Preferences

Philosophical Topics, 1993
L'A. esquisse une theorie permettant de representer graphiquement et de prevoir l'ordre de preference d'un individu dans un choix d'apres des considerations d ...
openaire   +1 more source

A generalized model companion for a theory of partially ordered fields

Journal of Symbolic Logic, 1979
The notion of a model companion for a first-order theory T was introduced and discussed in [1] and [2] as a generalization of the concept of a model completion of a theory. Both concepts reflect, on a general model theoretic level, properties of the theory of algebraically closed fields.
openaire   +1 more source

Decidability and ℵ₀-categoricity of theories of partially ordered sets

Journal of Symbolic Logic, 1980
AbstractThis paper is primarily concerned with ℵ0-categoricity of theories of partially ordered sets. It contains some general conjectures, a collection of known results and some new theorems on ℵ0-categoricity. Among the latter are the following.Corollary 3.3.
openaire   +2 more sources

A Constructive Solution to the Ranking Problem in Partial Order Optimality Theory

Journal of Logic, Language and Information, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources