共查询到20条相似文献,搜索用时 15 毫秒
1.
Thomas G. McLaughlin 《Mathematical Logic Quarterly》2010,56(3):323-330
Given a (nontrivial) Δ1 ultrapower ?/??, let ??U denote the set of all Π2‐correct substructures of ?/??; i.e., ??U is the collection of all those subsets of |?/??| that are closed under computable (in the sense of ?/??) functions. Defining in the obvious way the lattice ??(?/??)) with domain ??U, we obtain some preliminary results about lattice embeddings into – or realization as – an ??(?/??). The basis for these results, as far as we take the matter, consists of (1) the well‐known class of (non‐trivial) minimal ?/??'s, which function as atoms, and (2) the class of minimalfree ?/??'s, to whose nonemptiness a substantial section of the paper is devoted. It is shown that an infinite, convergent monotone sequence together with its limit point is embeddable in an ??(?/??), and that the initial segment lattices {0, 1,…, n } are not just embeddable in (as is trivial), but in fact realizable as, lattices ??(?/??). Finally, the diamond is (easily) embeddable; and if it is not realizable, then either the 1 ‐ 3 ‐ 1 lattice or the pentagon is at least embeddable (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
2.
3.
We determine bounds for the spectral and ??p norm of Cauchy–Hankel matrices of the form Hn=[1/(g+h(i+j))]ni,j=1≡ ([1/(g+kh)]ni,j=1), k=0, 1,…, n –1, where k is defined by i+j=k (mod n). Copyright © 2002 John Wiley & Sons, Ltd. 相似文献
4.
5.
We show that for each n ≥ 1, if T2n does not prove the weak pigeonhole principle for Σbn functions, then the collection scheme B Σ1 is not finitely axiomatizable over T2n. The same result holds with Sn2 in place of T 2n (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
6.
Walter Gautschi 《Numerische Mathematik》2005,100(3):483-484
Summary The idea of Gauss–Kronrod quadrature, in a germinal form, is traced back to an 1894 paper of R. Skutsch. 相似文献
7.
Shane Dye 《Discrete Applied Mathematics》2009,157(13):2958-2963
Minimum bounded edge-partition divides the edge set of a tree into the minimum number of disjoint connected components given a maximum weight for any component. It is an adaptation of the uniform edge-partition of a tree. An optimization algorithm is developed for this NP-hard problem, based on repeated bin packing of inter-related instances. The algorithm has linear running time for the class of ‘balanced trees’ common for the stochastic programming application which motivated investigation of this problem.Fast 2-approximation algorithms are formed for general instances by replacing the optimal bin packing with almost any bin packing heuristic. The asymptotic worst-case ratio of these approximation algorithms is never better than the absolute worst-case ratio of the bin packing heuristic used. 相似文献
8.
N. Halidias 《Applied Mathematics Letters》2003,16(8):1201-1204
Our goal here is to prove the existence of a nontrivial critical point to the following functional: . by using the well-known Mountain-Pass theorem with the Ceramil Palais-Smale condition. 相似文献
9.
A note on commutativity up to a factor of bounded operators 总被引:2,自引:0,他引:2
In this note, we explore commutativity up to a factor for bounded operators and in a complex Hilbert space. Conditions on possible values of the factor are formulated and shown to depend on spectral properties of the operators. Commutativity up to a unitary factor is considered. In some cases, we obtain some properties of the solution space of the operator equation and explore the structures of and that satisfy for some A quantum effect is an operator on a complex Hilbert space that satisfies The sequential product of quantum effects and is defined by We also obtain properties of the sequential product.
10.
The successive approximation method was applied for the first time by N.I. Ioakimidis to solve practical cases of a Cauchy singular integral equation: the airfoil one. In this paper we study a more general case. We prove the convergence of the method in this general case. The proposed method has been tested for two kernels which are particularly important in practice. Finally, some numerical examples illustrate the accuracy of the method. 相似文献
11.
We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δn+1 formulas. 相似文献
12.
In this paper, we consider the one‐dimensional Schrödinger operator on bounded time scales. We construct a space of boundary values of the minimal operator and describe all maximal dissipative, maximal accretive, self‐adjoint, and other extensions of the dissipative Schrödinger operators in terms of boundary conditions. In particular, using Lidskii's theorem, we prove a theorem on completeness of the system of root vectors of the dissipative Schrödinger operators on bounded time scales. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
13.
14.
In this short note, we establish an existence and uniqueness theorem about a positive bounded solution for a nonlinear infinite delay integral equation, which arises in some epidemic problems. As one can see, our main result can deal with some cases, to which many previous results cannot be applied. In addition, we show that our main result can also be applied to a Lasota–Wazewska model. 相似文献
15.
Ulrich Kohlenbach 《Archive for Mathematical Logic》2001,40(2):89-92
In this note we show that the so-called weakly extensional arithmetic in all finite types, which is based on a quantifier-free
rule of extensionality due to C. Spector and which is of significance in the context of G?del"s functional interpretation,
does not satisfy the deduction theorem for additional axioms. This holds already for Π0
1-axioms. Previously, only the failure of the stronger deduction theorem for deductions from (possibly open) assumptions (with
parameters kept fixed) was known.
Received: 11 March 1999 / Published online: 21 December 2000 相似文献
16.
A note on an example by van Mill 总被引:1,自引:1,他引:0
Adapting an earlier example by J. van Mill, we prove that there exists a zero-dimensional compact space of countable π-weight and uncountable character that is homogeneous under , but not under . 相似文献
17.
We prove that ?‐linear GMRES for solving a class of ?‐linear systems is faster than GMRES applied to the related ?‐linear systems in terms of matrix–vector products. Numerical examples are given to demonstrate the theoretical result. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
18.
Filipe Dantas 《Mathematical Methods in the Applied Sciences》2019,42(5):1572-1587
This work deals with the study of maximal ?p‐regularity of a pair (A,B) of bounded linear operators on a complex Banach space associated to the second order difference equation un + 2 = Bun + 1 + Aun + fn, where f is a given sequence on . We obtain results of characterization based on spectral analysis of the discrete sine family, which is the resolvent family of this equation. 相似文献
19.
In this note, some errors in a recent article by Li et al. (Improvements of preconditioned AOR iterative methods for L-matrices, J. Comput. Appl. Math. 206 (2007) 656–665) are pointed out and some correct results are presented. 相似文献
20.
It is well known that a univariate counting process with a given intensity function becomes Poisson, with unit parameter, if the original time parameter is replaced by the integrated intensity. P. A. Meyer (in Martingales (H. Dinges, Ed.), pp. 32–37. Lecture Notes in Mathematics, Vol. 190, Springer-Verlag, Berlin) showed that a similar result holds for multivariate counting processes which have continuous compensators. Even more is true in the multivariate case: If each coordinate process is transformed individually according to a convenient time change, the resulting Poisson processes become independent. Our aim is to show that the continuity assumption of the compensators can be relaxed and, when the jumps of the compensator become small, we obtain the independent Poisson processes as a limit. An application for testing goodness-of-fit in survival analysis is given. 相似文献