Types in class set theory and inaccessible cardinals

In this paper I prove the following theorems which are the converses of some results of Judah and Laver (1983) and of Judah and Marshall (1993).

-IfKM+ATW is not an extension by definition ofKM (and the model involved is well founded), then the existence of two inaccessible cardinals is consistent with ZF.

-IfKM+ATW is not a conservative extension ofKM (and the model involved is well founded), then the existence of an inaccessible number of inaccessible cardinals is consistent with ZF.

whereKM is Kelley Morse theory andKM+ATW isKM with types of well-orders.     

Preservation of Admissibility of Inference Rules in the Logics Similar to S4.2

We show that an arbitrary finitely approximable logic extending S4.2(Grz.2,KC) preserves all admissible inference rules of the logic S4.2(Grz.2,KC) if and only if this logic possesses the so-called semantic cocovering property.     

The Relation Reflection Scheme

We introduce a new axiom scheme for constructive set theory, the Relation Reflection Scheme (RRS). Each instance of this scheme is a theorem of the classical set theory ZF. In the constructive set theory CZF^–, when the axiom scheme is combined with the axiom of Dependent Choices (DC), the result is equivalent to the scheme of Relative Dependent Choices (RDC). In contrast to RDC, the scheme RRS is preserved in Heyting‐valued models of CZF^– using set‐generated frames. We give an application of the scheme to coinductive definitions of classes. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Long Borel hierarchies

We show that there is a model of ZF in which the Borel hierarchy on the reals has length ω₂. This implies that ω₁ has countable cofinality, so the axiom of choice fails very badly in our model. A similar argument produces models of ZF in which the Borel hierarchy has exactly λ + 1 levels for any given limit ordinal λ less than ω₂. We also show that assuming a large cardinal hypothesis there are models of ZF in which the Borel hierarchy is arbitrarily long. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Odd‐sized partitions of Russell‐sets

In the setting of ZF, i.e., Zermelo–Fraenkel set theory without the Axiom of Choice (AC), we study partitions of Russell‐sets into sets each with exactly n elements (called n ‐ary partitions), for some integer n. We show that if n is odd, then a Russell‐set X has an n ‐ary partition if and only if |X | is divisible by n. Furthermore, we establish that it is relative consistent with ZF that there exists a Russell‐set X such that |X | is not divisible by any finite cardinal n > 1 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document}

This paper describes a new and user‐friendly method for constructing models of non‐well‐founded set theory. Given a sufficiently well‐behaved system θ of non‐well‐founded set‐theoretic equations, we describe how to construct a model M_θ for $\mathsf {ZFC}^-$ in which θ has a non‐degenerate solution. We shall prove that this M_θ is the smallest model for $\mathsf {ZFC}^-$ which contains $\mathbf {V}$ and has a non‐degenerate solution of θ.     

James sequences and Dependent Choices

We prove James's sequential characterization of (compact) reflexivity in set‐theory ZF + DC , where DC is the axiom of Dependent Choices. In turn, James's criterion implies that every infinite set is Dedekind‐infinite, whence it is not provable in ZF . Our proof in ZF + DC of James' criterion leads us to various notions of reflexivity which are equivalent in ZFC but are not equivalent in ZF . We also show that the weak compactness of the closed unit ball of a (simply) reflexive space does not imply the Boolean Prime Ideal theorem : this solves a question raised in [6]. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Generalized factorization for N×N Daniele–Khrapkov matrix functions

A generalization to N×N of the 2×2 Daniele–Khrapkov class of matrix‐valued functions is proposed. This class retains some of the features of the 2×2 Daniele–Khrapkov class, in particular, the presence of certain square‐root functions in its definition. Functions of this class appear in the study of finite‐dimensional integrable systems. The paper concentrates on giving the main properties of the class, using them to outline a method for the study of the Wiener–Hopf factorization of the symbols of this class. This is done through examples that are completely worked out. One of these examples corresponds to a particular case of the motion of a symmetric rigid body with a fixed point (Lagrange top). Copyright © 2001 John Wiley & Sons, Ltd.     

Polynomial frames on the sphere

We introduce a class of polynomial frames suitable for analyzing data on the surface of the unit sphere of a Euclidean space. Our frames consist of polynomials, but are well localized, and are stable with respect to all the L ^p norms. The frames belonging to higher and higher scale wavelet spaces have more and more vanishing moments.     

Barwise's information frames and modal logics

 The paper studies Barwise's information frames and answers the John Barwise question: to find axiomatizations for the modal logics generated by information frames. We find axiomatic systems for (i) the modal logic of all complete information frames, (ii) the logic of all sound and complete information frames, (iii) the logic of all hereditary and complete information frames, (iv) the logic of all complete, sound and hereditary information frames, and (v) the logic of all consistent and complete information frames. The notion of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4 respectively. To develop general theory, we prove that (i) any Kripke complete modal logic is the modal logic of a certain class of information frames and that (ii) the modal logic generated by any given class of complete, rarefied and fully classified information frames is Kripke complete. This paper is dedicated to the memory of talented mathematician John Barwise. Received: 7 May 2000 Published online: 10 October 2002 Key words or phrases: Knowledge presentation – Information – Information flow – Information frames – Modal logic-Kripke model     

On Generalized Friedrichs and Krein‐von Neumann Extensions and Canonical Systems

Let S be a densely defined and closed symmetric relation in a Hilbert space ℋ︁ with defect numbers (1,1), and let A be some of its canonical selfadjoint extensions. According to Krein's formula, to S and A corresponds a so‐called Q‐function from the Nevanlinna class N . In this note we show to which subclasses N _γ of N the Q‐functions corresponding to S and its canonical selfadjoint extensions belong and specify the Q‐functions of the generalized Friedrichs and Krein‐von Neumann extensions. A result of L. de Branges implies that to each function Q ∈ N there corresponds a unique Hamiltonian H such that Q is the Titchmarsh‐Weyl coefficient of the two‐dimensional canonical system J_y′ = —zHy on [0, ∞) where Weyl's limit point case prevails at ∞. Then the boundary condition y(0) = 0 corresponds to a symmetric relation T_min with defect numbers (1,1) in the Hilbert space L²_H, and Q is equal to the Q‐function with respect to the extension corresponding to the boundary condition y₁(0) = 0. If H satisfies some growth conditions at 0 or ∞, wepresent results on the corresponding Q‐functions and show under which conditions the generalized Friedrichs or Krein‐von Neumann extension exists.     

Duality for frames in Krein spaces

A J‐frame for a Krein space is in particular a frame for (in the Hilbert space sense). But it is also compatible with the indefinite inner‐product of , meaning that it determines a pair of maximal uniformly definite subspaces, an analogue to the maximal dual pair associated with an orthonormal basis in a Krein space. This work is devoted to study duality for J‐frames in Krein spaces. Also, tight and Parseval J‐frames are defined and characterized.     

Bounded distributive lattices with strict implication

The present paper introduces and studies the variety WH of weakly Heyting algebras. It corresponds to the strict implication fragment of the normal modal logic K which is also known as the subintuitionistic local consequence of the class of all Kripke models. The tools developed in the paper can be applied to the study of the subvarieties of WH; among them are the varieties determined by the strict implication fragments of normal modal logics as well as varieties that do not arise in this way as the variety of Basic algebras or the variety of Heyting algebras. Apart from WH itself the paper studies the subvarieties of WH that naturally correspond to subintuitionistic logics, namely the variety of R‐weakly Heyting algebras, the variety of T‐weakly Heyting algebras and the varieties of Basic algebras and subresiduated lattices. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Countable Products of Finite Hausdorff Spaces

We investigate in ZF (i.e., Zermelo‐Fraenke set theory without the axiom of choice) conditions that are necessary and sufficient for countable products ∏_m∈ℕX_m of (a) finite Hausdorff spaces X_m resp. (b) Hausdorff spaces X_m with at most n points to be compact resp. Baire. Typica results: (i) Countable products of finite Hausdorff spaces are compact (resp. Baire) if and only if countable products of non‐empty finite sets are non‐empty. (ii) Countable products of discrete spaces with at most n + 1 points are compact (resp. Baire) if and only if countable products of non‐empty sets with at most n points are non‐empty.     

On Operations and Linear Extensions of Well Partially Ordered Sets

A (partially) ordered set P is well founded if no infinite decreasing sequences occur in P. A well founded poset containing no infinite antichains is called partially well ordered. We investigate some operations preserving that property and linear extensions of partial well orders. This revised version was published online in September 2006 with corrections to the Cover Date.     

The Projective Beth Property and Interpolation in Positive and Related Logics

We look at the interplay between the projective Beth property in non-classical logics and interpolation. Previously, we proved that in positive logics as well as in superintuitionistic and modal ones, the projective Beth property PB2 follows from Craig's interpolation property and implies the restricted interpolation property IPR. Here, we show that IPR and PB2 are equivalent in positive logics, and also in extensions of the superintuitionistic logic KC and of the modal logic Grz.2. Supported by RFBR grant No. 06-01-00358, by INTAS grant No. 04-77-7080, and by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 85–113, January–February, 2006.     

Kripke‐style semantics for many‐valued logics

This paper deals with Kripke‐style semantics for many‐valued logics. We introduce various types of Kripke semantics, and we connect them with algebraic semantics. As for modal logics, we relate the axioms of logics extending MTL to properties of the Kripke frames in which they are valid. We show that in the propositional case most logics are complete but not strongly complete with respect to the corresponding class of complete Kripke frames, whereas in the predicate case there are important many‐valued logics like BL, ? and Π, which are not even complete with respect to the class of all predicate Kripke frames in which they are valid. Thus although very natural, Kripke semantics seems to be slightly less powerful than algebraic semantics. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The sub‐Riemannian cut locus of H‐type groups

In the present paper we prove that the sub‐Riemannian cut locus at the origin of a wide class of nilpotent groups of step two, called H‐type groups, corresponds to the center of the group. We obtain this result by completely describing the sub‐Riemannian geodesics in the group, and using these to obtain three disjoint sets of points in the group determined by the number of geodesics joining them to the origin.     

Erratum to: Sobolev Duals in Frame Theory and Sigma-Delta Quantization

A new class of alternative dual frames is introduced in the setting of finite frames for ℝ ^d . These dual frames, called Sobolev duals, provide a high precision linear reconstruction procedure for Sigma-Delta (ΣΔ) quantization of finite frames. The main result is summarized as follows: reconstruction with Sobolev duals enables stable rth order Sigma-Delta schemes to achieve deterministic approximation error of order O(N^-r)\mathcal{O}(N^{-r}) for a wide class of finite frames of size N. This asymptotic order is generally not achievable with canonical dual frames. Moreover, Sobolev dual reconstruction leads to minimal mean squared error under the classical white noise assumption.     

Wavelet bi‐frames with uniform symmetry

Wavelet bi‐frames with uniform symmetry are discussed in this paper. Every refinable function in the bi‐frame system is symmetric, which is very useful in the image processing and curve and surface multiresolution processing. By the aid of the lifting scheme, bi‐frame multiresolution algorithms can be divided into several iterative steps, and each step can be shown by a symmetric template. The template‐based procedure is established for constructing bi‐frames with uniform symmetry and N > 2 generators. In particular, we take the bi‐frame with three generators as an example to provide a clearer picture of the template‐based procedure for constructing bi‐frames. Three types of bi‐frames with three generators are studied, and some examples with certain smoothness are constructed. These examples include some bi‐frames with interpolating property. Copyright © 2016 John Wiley & Sons, Ltd.