共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
3.
4.
5.
The logic is the intuitionistic version of Löb's Logic plus the completeness principle . In this paper, we prove an arithmetical completeness theorems for for theories equipped with two provability predicates □ and △ that prove the schemes and for . We provide two salient instances of the theorem. In the first, □ is fast provability and △ is ordinary provability and, in the second, □ is ordinary provability and △ is slow provability.Using the second instance, we reprove a theorem previously obtained by Mohammad Ardeshir and Mojtaba Mojtahedi [1] determining the -provability logic of Heyting Arithmetic. 相似文献
6.
7.
8.
We define a ribbon category , depending on a parameter β, which encompasses Cautis, Kamnitzer and Morrison's spider category, and describes for the monoidal category of representations of generated by exterior powers of the vector representation and their duals. We identify this category with a direct limit of quotients of a dual idempotented quantum group , proving a mixed version of skew Howe duality in which exterior powers and their duals appear at the same time. We show that the category gives a unified natural setting for defining the colored link invariant (for ) and the colored HOMFLY-PT polynomial (for β generic). 相似文献
9.
Relatively recently it was proved that if Γ is an arbitrary set, then any equivalent norm on can be approximated uniformly on bounded sets by polyhedral norms and smooth norms, with arbitrary precision. We extend this result to more classes of spaces having uncountable symmetric bases, such as preduals of the ‘discrete’ Lorentz spaces , and certain symmetric Nakano spaces and Orlicz spaces. We also show that, given an arbitrary ordinal number α, there exists a scattered compact space K having Cantor–Bendixson height at least α, such that every equivalent norm on can be approximated as above. 相似文献
11.
12.
13.
14.
Shai Shechter 《Journal of Pure and Applied Algebra》2019,223(10):4384-4425
Let be a complete discrete valuation ring with finite residue field of odd characteristic, and let G be a symplectic or special orthogonal group scheme over . For any let denote the ?-th principal congruence subgroup of . An irreducible character of the group is said to be regular if it is trivial on a subgroup for some ?, and if its restriction to consists of characters of minimal -stabilizer dimension. In the present paper we consider the regular characters of such classical groups over , and construct and enumerate all regular characters of , when the characteristic of is greater than two. As a result, we compute the regular part of their representation zeta function. 相似文献
15.
We first give an example of a rigid structure of computable dimension 2 such that the unique isomorphism between two non-computably isomorphic computable copies has Turing degree strictly below , and not above . This gives a first example of a computable structure with a degree of categoricity that does not belong to an interval of the form for any computable ordinal α. We then extend the technique to produce a rigid structure of computable dimension 3 such that if , , and are the degrees of isomorphisms between distinct representatives of the three computable equivalence classes, then each . The resulting structure is an example of a structure that has a degree of categoricity, but not strongly. 相似文献
16.
《Journal of Pure and Applied Algebra》2023,227(6):107283
Let be the category with the set of objects and morphisms given by the functions between the standard finite sets of the corresponding cardinalities. Let be the obvious functor from this category to the category of sets in a given Grothendieck universe U. In this paper we construct, for any Jf-relative monad RR and any left RR-module LM, a C-system and explicitly compute the action of the four B-system operations on its B-sets.In the introduction we explain in detail the relevance of this result to the construction of the term C-systems of type theories. 相似文献
17.
18.
《Discrete Mathematics》2022,345(11):113058
Given an undirected graph , a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for such a coloring is the CFON chromatic number of G, denoted by .In previous work [WG 2020], we showed the upper bound , where denotes the distance to cluster parameter of G. In this paper, we obtain the improved upper bound of . We also exhibit a family of graphs for which , thereby demonstrating that our upper bound is tight. 相似文献
19.
20.
We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form , where is a finite-dimensional Lie algebra over a field of characteristic zero, and I is a finite-codimensional ideal of generated by monomials. In particular, when is semisimple and is algebraically closed, we construct a set of algebraically independent generators for the algebra of invariant polynomials. In addition, we describe a transversal slice to the space of regular orbits in . As an application of our main result, we show that the center of the universal enveloping algebra of acts trivially on all irreducible finite-dimensional representations provided I has codimension at least two. 相似文献