DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS

2014 ◽  
Vol 79 (4) ◽  
pp. 1224-1246 ◽  
Author(s):  
MERLIJN SEVENSTER
Keyword(s):  
Expressive Power ◽  
Generalized Quantifiers ◽  
Np Hard ◽  
First Order ◽  
Image Position

AbstractWe study the expressive power of independence-friendly quantifier prefixes composed of universal$\left( {\forall x/X} \right)$, existential$\left( {\exists x/X} \right)$, and majority quantifiers$\left( {Mx/X} \right)$. We provide four quantifier prefixes that can express NP hard properties and show that all quantifier prefixes capable of expressing NP-hard properties embed at least one of these four quantifier prefixes. As for the quantifier prefixes that do not embed any of these four quantifier prefixes, we show that they are equivalent to a first-order quantifier prefix composed of$\forall x$,$\exists x$, and Mx. In unison, our results imply a dichotomy result: every independence-friendly quantifier prefix is either decidable in LOGSPACE or NP hard.

Generalized quantifiers and elementary extensions of countable models

1977 ◽  
Vol 42 (3) ◽  
pp. 341-348 ◽  
Author(s):  
Małgorzata Dubiel
Keyword(s):  
Countable Model ◽  
Generalized Quantifiers ◽  
Natural Question ◽  
Elementary Extension ◽  
First Order ◽  
Transitive Model ◽  
Order Language ◽  
Image Position ◽  
Countable Models

Let L be a countable first-order language and L(Q) be obtained by adjoining an additional quantifier Q. Q is a generalization of the quantifier “there exists uncountably many x such that…” which was introduced by Mostowski in [4]. The logic of this latter quantifier was formalized by Keisler in [2]. Krivine and McAloon [3] considered quantifiers satisfying some but not all of Keisler's axioms. They called a formula φ(x) countable-like iffor every ψ. In Keisler's logic, φ(x) being countable-like is the same as ℳ⊨┐Qxφ(x). The main theorem of [3] states that any countable model ℳ of L[Q] has an elementary extension N, which preserves countable-like formulas but no others, such that the only sets definable in both N and M are those defined by formulas countable-like in M. Suppose C(x) in M is linearly ordered and noncountable-like but with countable-like proper segments. Then in N, C will have new elements greater than all “old” elements but no least new element — otherwise it will be definable in both models. The natural question is whether it is possible to use generalized quantifiers to extend models elementarily in such a way that a noncountable-like formula C will have a minimal new element. There are models and formulas for which it is not possible. For example let M be obtained from a minimal transitive model of ZFC by letting Qxφ(x) mean “there are arbitrarily large ordinals satisfying φ”.

Relativized logspace and generalized quantifiers over finite ordered structures

1997 ◽  
Vol 62 (2) ◽  
pp. 545-574 ◽  
Author(s):  
Georg Gottlob
Keyword(s):  
Sufficient Conditions ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
General Point ◽  
Complexity Classes ◽  
Generalized Quantifiers ◽  
Ordered Structures ◽  
First Order ◽  
Henkin Quantifiers

AbstractWe here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures LC, i.e., logarithmic space relativized to an oracle in C. We show that this is not always true. However, after studying the problem from a general point of view, we derive sufficient conditions on C such that FO(Q) captures LC. These conditions are fulfilled by a large number of relevant complexity classes, in particular, for example, by NP. As an application of this result, it follows that first order logic extended by Henkin quantifiers captures LNP. This answers a question raised by Blass and Gurevich [Ann. Pure Appl. Logic, vol. 32, 1986]. Furthermore we show that for many families Q of generalized quantifiers (including the family of Henkin quantifiers), each FO(Q)-formula can be replaced by an equivalent FO(Q)-formula with only two occurrences of generalized quantifiers. This generalizes and extends an earlier normal-form result by I. A. Stewart [Fundamenta Inform, vol. 18, 1993].

scholarly journals Constructing weak simulations from linear implications for processes with private names

2019 ◽  
Vol 29 (8) ◽  
pp. 1275-1308 ◽  
Author(s):  
Ross Horne ◽  
Alwen Tiu
Keyword(s):  
Expressive Power ◽  
Dual Pair ◽  
Proof System ◽  
Branching Time ◽  
First Order ◽  
Order Extension

AbstractThis paper clarifies that linear implication defines a branching-time preorder, preserved in all contexts, when used to compare embeddings of process in non-commutative logic. The logic considered is a first-order extension of the proof system BV featuring a de Morgan dual pair of nominal quantifiers, called BV1. An embedding of π-calculus processes as formulae in BV1 is defined, and the soundness of linear implication in BV1 with respect to a notion of weak simulation in the π -calculus is established. A novel contribution of this work is that we generalise the notion of a ‘left proof’ to a class of formulae sufficiently large to compare embeddings of processes, from which simulating execution steps are extracted. We illustrate the expressive power of BV1 by demonstrating that results extend to the internal π -calculus, where privacy of inputs is guaranteed. We also remark that linear implication is strictly finer than any interleaving preorder.

Resolution of T. Ward's Question and the Israel–Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics

2014 ◽  
Vol 24 (1) ◽  
pp. 195-215
Author(s):  
JEFFREY GAITHER ◽  
GUY LOUCHARD ◽  
STEPHAN WAGNER ◽  
MARK DANIEL WARD
Keyword(s):  
Weighted Average ◽  
Analytic Number Theory ◽  
Combinatorial Structure ◽  
Asymptotic Growth ◽  
First Order ◽  
Integer Sequence ◽  
Precise Analysis ◽  
Formula Group ◽  
Fourth Author ◽  
Image Position

We analyse the first-order asymptotic growth of \[ a_{n}=\int_{0}^{1}\prod_{j=1}^{n}4\sin^{2}(\pi jx)\, dx. \] The integer an appears as the main term in a weighted average of the number of orbits in a particular quasihyperbolic automorphism of a 2n-torus, which has applications to ergodic and analytic number theory. The combinatorial structure of an is also of interest, as the ‘signed’ number of ways in which 0 can be represented as the sum of ϵjj for −n ≤ j ≤ n (with j ≠ 0), with ϵj ∈ {0, 1}. Our result answers a question of Thomas Ward (no relation to the fourth author) and confirms a conjecture of Robert Israel and Steven Finch.

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 Existence of nonoscillatory solutions of first order nonlinear neutral equations

1990 ◽  
Vol 32 (2) ◽  
pp. 180-192 ◽  
Author(s):  
Lu Wudu
Keyword(s):  
Nonoscillatory Solution ◽  
Sufficient Condition ◽  
Neutral Equation ◽  
Necessary And Sufficient Condition ◽  
Nonoscillatory Solutions ◽  
Neutral Equations ◽  
First Order ◽  
Image Position ◽  
Necessary And Sufficient

AbstractConsider the nonlinear neutral equationwhere pi(t), hi(t), gj(t), Q(t) Є C[t0, ∞), limt→∞hi(t) = ∞, limt→∞gj(t) = ∞ i Є Im = {1, 2, …, m}, j Є In = {1, 2, …, n}. We obtain a necessary and sufficient condition (2) for this equation to have a nonoscillatory solution x(t) with limt→∞ inf|x(t)| > 0 (Theorems 5 and 6) or to have a bounded nonoscillatory solution x(t) with limt→∞ inf|x(t)| > 0 (Theorem 7).

A note on the undefinability of cuts

1983 ◽  
Vol 48 (3) ◽  
pp. 564-569 ◽  
Author(s):  
J.B. Paris ◽  
C. Dimitracopoulos
Keyword(s):  
First Order ◽  
Nonstandard Model ◽  
Image Position

The results in this paper were motivated by the following result due to R. Solovay.Theorem 1 (Solovay). Let M be a nonstandard model of Peano's first order axioms P and let I ⊂e M (i.e. ϕ ≠ ⊂ M and I is closed under < and successor). Then for each of the functions we can define J ⊆e I in ‹M, I› such that J is closed under that function. (∣x∣ denotes [log2(x)].)Proof. Just notice that the cuts defined byare successively closed under In view of Theorem 1, the following question was raised by R. Solovay: Can we define J ⊆ I in ‹M, I› such that J is closed under exponentiation? In Theorem 2 we show that the answer is “no”. Theorem 3 is based on Theorem 2 and extends the technique to cuts which are models of subsystems of P.To prove both theorems we shall need an estimate due to R. Parikh (see [1], especially the proof of Theorem 2.2a). For the sake of completeness, and also to introduce some notation we shall sketch Parikh's estimate in the next section. At all times we shall give the easiest estimates which still work rather than the sharpest ones.

scholarly journals On the integration processes of A. Huťa

1963 ◽  
Vol 3 (2) ◽  
pp. 202-206 ◽  
Author(s):  
J. C. Butcher
Keyword(s):  
Differential Equation ◽  
Order Differential Equation ◽  
Sixth Order ◽  
Order Accuracy ◽  
First Order ◽  
Runge Kutta ◽  
Image Position

Huta [1], [2] has given two processes for solving a first order differential equation to sixth order accuracy. His methods are each eight stage Runge-Kutta processes and differ mainly in that the later process has simpler coefficients occurring in it.

Second-order logic, philosophical issues in

2018 ◽  
Author(s):  
Stewart Shapiro
Keyword(s):  
Mathematical Practice ◽  
Expressive Power ◽  
Deductive System ◽  
Second Order ◽  
Order Logic ◽  
Mathematical Structures ◽  
First Order ◽  
Correct Reasoning ◽  
Second Order Logic

Typically, a formal language has variables that range over a collection of objects, or domain of discourse. A language is ‘second-order’ if it has, in addition, variables that range over sets, functions, properties or relations on the domain of discourse. A language is third-order if it has variables ranging over sets of sets, or functions on relations, and so on. A language is higher-order if it is at least second-order. Second-order languages enjoy a greater expressive power than first-order languages. For example, a set S of sentences is said to be categorical if any two models satisfying S are isomorphic, that is, have the same structure. There are second-order, categorical characterizations of important mathematical structures, including the natural numbers, the real numbers and Euclidean space. It is a consequence of the Löwenheim–Skolem theorems that there is no first-order categorical characterization of any infinite structure. There are also a number of central mathematical notions, such as finitude, countability, minimal closure and well-foundedness, which can be characterized with formulas of second-order languages, but cannot be characterized in first-order languages. Some philosophers argue that second-order logic is not logic. Properties and relations are too obscure for rigorous foundational study, while sets and functions are in the purview of mathematics, not logic; logic should not have an ontology of its own. Other writers disqualify second-order logic because its consequence relation is not effective – there is no recursively enumerable, sound and complete deductive system for second-order logic. The deeper issues underlying the dispute concern the goals and purposes of logical theory. If a logic is to be a calculus, an effective canon of inference, then second-order logic is beyond the pale. If, on the other hand, one aims to codify a standard to which correct reasoning must adhere, and to characterize the descriptive and communicative abilities of informal mathematical practice, then perhaps there is room for second-order logic.

7.—Elliptic Singular Perturbations of First-order Operators with Critical Points

1976 ◽  
Vol 74 ◽  
pp. 91-113 ◽  
Author(s):  
P. P. N. de Groen
Keyword(s):  
Boundary Value Problem ◽  
Critical Points ◽  
Elliptic Boundary ◽  
Elliptic Boundary Value Problem ◽  
Internal Layers ◽  
Order Operator ◽  
Elliptic Boundary Value ◽  
First Order ◽  
Special Values ◽  
Image Position

SynopsisWe study the asymptotic behaviour for ɛ→+0 of the solution Φ of the elliptic boundary value problemis a bounded domain in ℝ2, 2 is asecond-order uniformly elliptic operator, 1 is a first-order operator, which has critical points in the interior of , i.e. points at which the coefficients of the first derivatives vanish, ɛ and μ are real parameters and h is a smooth function on . We construct firstorder approximations to Φ for all types of nondegenerate critical points of 1 and prove their validity under some restriction on the range of μ.In a number of cases we get internal layers of nonuniformity (which extend to the boundary in the saddle-point case) near the critical points; this depends on the position of the characteristics of 1 and their direction. At special values of the parameter μ outside the range in which we could prove validity we observe ‘resonance’, a sudden displacement of boundary layers; these points are connected with the spectrum of the operator ɛ2 + 1 subject to boundary conditions of Dirichlet type.

Sign in / Sign up

Export Citation Format

Share Document