首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Constructive theories usually have interesting metamathematical properties where explicit witnesses can be extracted from proofs of existential sentences. For relational theories, probably the most natural of these is the existence property, EP, sometimes referred to as the set existence property  . This states that whenever (∃x)?(x)(x)?(x) is provable, there is a formula χ(x)χ(x) such that (∃!x)?(x)∧χ(x)(!x)?(x)χ(x) is provable. It has been known since the 80s that EP holds for some intuitionistic set theories and yet fails for IZF. Despite this, it has remained open until now whether EP holds for the most well known constructive set theory, CZF. In this paper we show that EP fails for CZF.  相似文献   

2.
Assume that the problem P0P0 is not solvable in polynomial time. Let T   be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT}T{ConT} as the minimal extension of T   proving for some algorithm that it decides P0P0 as fast as any algorithm BB with the property that T   proves that BB decides P0P0. Here, ConTConT claims the consistency of T. As a byproduct, we obtain a version of Gödel?s Second Incompleteness Theorem. Moreover, we characterize problems with an optimal algorithm in terms of arithmetical theories.  相似文献   

3.
Let FF be an infinite field with characteristic not equal to two. For a graph G=(V,E)G=(V,E) with V={1,…,n}V={1,,n}, let S(G;F)S(G;F) be the set of all symmetric n×nn×n matrices A=[ai,j]A=[ai,j] over FF with ai,j≠0ai,j0, i≠jij if and only if ij∈EijE. We show that if G is the complement of a partial k  -tree and m?k+2m?k+2, then for all nonsingular symmetric m×mm×m matrices K   over FF, there exists an m×nm×n matrix U   such that UTKU∈S(G;F)UTKUS(G;F). As a corollary we obtain that, if k+2?m?nk+2?m?n and G is the complement of a partial k-tree, then for any two nonnegative integers p and q   with p+q=mp+q=m, there exists a matrix in S(G;R)S(G;R) with p positive and q negative eigenvalues.  相似文献   

4.
The dimension of a point x   in Euclidean space (meaning the constructive Hausdorff dimension of the singleton set {x}{x}) is the algorithmic information density of x  . Roughly speaking, this is the least real number dim(x)dim(x) such that r×dim(x)r×dim(x) bits suffice to specify x   on a general-purpose computer with arbitrarily high precision 2−r2r. The dimension spectrum of a set X   in Euclidean space is the subset of [0,n][0,n] consisting of the dimensions of all points in X.  相似文献   

5.
Let G   denote a locally compact Hausdorff group and M(G)M(G) be the space of all bounded complex-valued regular Borel measures on G  . In this paper, we define two strict topologies on M(G)M(G) and study various properties of these topologies such as metrizability, barrelledness and completeness. We also determine the dual space of M(G)M(G) and consider various continuity properties for the convolution product on M(G)M(G) under these topologies.  相似文献   

6.
7.
8.
9.
Given an arbitrarily weak notion of left-〈f〉f-porosity and an arbitrarily strong notion of right-〈g〉g-porosity, we construct an example of closed subset of RR which is not σ  -left-〈f〉f-porous and is right-〈g〉g-porous. We also briefly summarize the relations between three different definitions of porosity controlled by a function; we then observe that our construction gives the example for any combination of these definitions of left-porosity and right-porosity.  相似文献   

10.
Let FF be an algebraically closed field. Let VV be a vector space equipped with a non-degenerate symmetric or symplectic bilinear form B   over FF. Suppose the characteristic of FF is sufficiently large  , i.e. either zero or greater than the dimension of VV. Let I(V,B)I(V,B) denote the group of isometries. Using the Jacobson–Morozov lemma we give a new and simple proof of the fact that two elements in I(V,B)I(V,B) are conjugate if and only if they have the same elementary divisors.  相似文献   

11.
We provide a number of simplified and improved separations between pairs of Resolution-with-bounded-conjunction refutation systems, Res(d)Res(d), as well as their tree-like versions, Res?(d)Res?(d). The contradictions we use are natural combinatorial principles: the Least number principle  , LNPnLNPn and an ordered variant thereof, the Induction principle  , IPnIPn.  相似文献   

12.
For any n-by-n matrix A  , we consider the maximum number k=k(A)k=k(A) for which there is a k-by-k compression of A   with all its diagonal entries in the boundary ∂W(A)W(A) of the numerical range W(A)W(A) of A. If A   is a normal or a quadratic matrix, then the exact value of k(A)k(A) can be computed. For a matrix A   of the form B⊕CBC, we show that k(A)=2k(A)=2 if and only if the numerical range of one summand, say, B is contained in the interior of the numerical range of the other summand C   and k(C)=2k(C)=2. For an irreducible matrix A  , we can determine exactly when the value of k(A)k(A) equals the size of A  . These are then applied to determine k(A)k(A) for a reducible matrix A   of size 4 in terms of the shape of W(A)W(A).  相似文献   

13.
14.
15.
16.
17.
18.
We present a regularity result for weak solutions of the 2D quasi-geostrophic equation with supercritical (α<1/2α<1/2) dissipation α(−Δ)(Δ)α: If a Leray–Hopf weak solution is Hölder continuous θ∈Cδ(R2)θCδ(R2) with δ>1−2αδ>12α on the time interval [t0,t][t0,t], then it is actually a classical solution on (t0,t](t0,t].  相似文献   

19.
For a non-degenerate convex subset Y of the n  -dimensional Euclidean space RnRn, let F(Y)F(Y) be the family of all fuzzy sets of RnRn which are upper semicontinuous, fuzzy convex and normal with compact supports contained in Y  . We show that the space F(Y)F(Y) with the topology of sendograph metric is homeomorphic to the separable Hilbert space ?2?2 if Y   is compact; and the space F(Rn)F(Rn) is also homeomorphic to ?2?2.  相似文献   

20.
Let f(t)f(t) be an operator monotone function. Then A?BA?B implies f(A)?f(B)f(A)?f(B), but the converse implication is not true. Let A?BA?B be the geometric mean of A,B?0A,B?0. If A?BA?B, then B−1?A?IB1?A?I; the converse implication is not true either. We will show that if f(λB+I)−1?f(λA+I)?If(λB+I)1?f(λA+I)?I for all sufficiently small λ>0λ>0, then f(λA+I)?f(λB+I)f(λA+I)?f(λB+I) and A?BA?B. Moreover, we extend it to multi-variable matrices means.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号