Two‐cardinal diamond star

Our main results are: (A) It is consistent relative to a large cardinal that holds but fails. (B) If holds and are two infinite cardinals such that and λ carries a good scale, then holds. (C) If are two cardinals such that κ is λ‐Shelah and , then there is no good scale for λ.     

Completeness of intermediate logics with doubly negated axioms

Let denote a first‐order logic in a language that contains infinitely many constant symbols and also containing intuitionistic logic . By , we mean the associated logic axiomatized by the double negation of the universal closure of the axioms of plus . We shall show that if is strongly complete for a class of Kripke models , then is strongly complete for the class of Kripke models that are ultimately in .     

Matrices of completely Ramsey sets with infinitely many rows

The main result of the present article is the following: Let N be an infinite subset of , , and let be a matrix with infinitely many rows of completely Ramsey subsets of such that for every n, . Then there exist , a sequence of nonempty finite subsets of N, and an infinite subset T of such that for every infinite subset I of . We also give an application of this result to partitions of an uncountable analytic subset of a Polish space X into sets belonging to the σ‐algebra generated by the analytic subsets of X.     

On the set‐theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements

In set theory without the Axiom of Choice , we study the deductive strength of the statements (“Every partially ordered set without a maximal element has two disjoint cofinal subsets”), (“Every partially ordered set without a maximal element has a countably infinite disjoint family of cofinal subsets”), (“Every linearly ordered set without a maximum element has two disjoint cofinal subsets”), and (“Every linearly ordered set without a maximum element has a countably infinite disjoint family of cofinal subsets”). Among various results, we prove that none of the above statements is provable without using some form of choice, is equivalent to , + (Dependent Choices) implies , does not imply in (Zermelo‐Fraenkel set theory with the Axiom of Extensionality modified in order to allow the existence of atoms), does not imply in (Zermelo‐Fraenkel set theory minus ) and (hence, ) is strictly weaker than in .     

Characterization of ‐like and c0‐like equivalence relations

In this paper, notions of ‐like and c₀‐like equivalence relations are introduced. We characterize the positions of ‐like and c₀‐like equivalence relations in the Borel reducibility hierarchy by comparing them with equivalence relations and .     

Automorphisms of η‐like computable linear orderings and Kierstead's conjecture

We develop an approach to the longstanding conjecture of Kierstead concerning the character of strongly nontrivial automorphisms of computable linear orderings. Our main result is that for any η‐like computable linear ordering , such that has no interval of order type η, and such that the order type of is determined by a ‐limitwise monotonic maximal block function, there exists computable such that has no nontrivial automorphism.     

Lipschitz extensions of definable p‐adic functions

In this paper, we prove a definable version of Kirszbraun's theorem in a non‐Archimedean setting for definable families of functions in one variable. More precisely, we prove that every definable function , where and , that is λ‐Lipschitz in the first variable, extends to a definable function that is λ‐Lipschitz in the first variable.     

Hyperhypersimple sets and Q1‐reducibility

We prove that the c.e. Q₁‐degrees are not dense, and there exists a c.e. Q₁‐degree with no minimal c.e. predecessors. It is proved that if M₁ and M₂ are maximal sets such that then or . We also show that there exist infinite collections of Q₁‐degrees and such that the following hold: (i) for every , , , and , (ii) each consists entirely of maximal sets; and (iii) each consists entirely of non‐maximal hyperhypersimple sets.     

On Martin's Axiom and Forms of Choice

Martin's Axiom is the statement that for every well‐ordered cardinal , the statement holds, where is “if is a c.c.c. quasi order and is a family of dense sets in P, then there is a ‐generic filter of P”. In , the fragment is provable, but not in general in . In this paper, we investigate the interrelation between and various choice principles. In the choiceless context, it makes sense to drop the requirement that the cardinal κ be well‐ordered, and we can define for any (not necessarily well‐ordered) cardinal the statement to be “if is a c.c.c. quasi order with , and is a family of dense sets in P, then there is a ‐generic filter of P”. We then define to be the statement that for every (not necessarily well‐ordered) cardinal , we have that holds. We then investigate the set‐theoretic strength of the principle .     

A decidable paraconsistent relevant logic: Gentzen system and Routley‐Meyer semantics

In this paper, the positive fragment of the logic of contraction‐less relevant implication is extended with the addition of a paraconsistent negation connective similar to the strong negation connective in Nelson's paraconsistent four‐valued logic . This extended relevant logic is called , and it has the property of constructible falsity which is known to be a characteristic property of . A Gentzen‐type sequent calculus for is introduced, and the cut‐elimination and decidability theorems for are proved. Two extended Routley‐Meyer semantics are introduced for , and the completeness theorems with respect to these semantics are proved.     

Forcing a countable structure to belong to the ground model

Suppose that P is a forcing notion, L is a language (in ), a P‐name such that “ is a countable L‐structure”. In the product , there are names such that for any generic filter over , and . Zapletal asked whether or not implies that there is some such that . We answer this question negatively and discuss related issues.     

The Boolean prime ideal theorem and products of cofinite topologies

We show:

1. The Boolean Prime Ideal theorem is equivalent to each one of the statements:
   1. “For every family of compact spaces, for every family of basic closed sets of the product with the fip there is a family of subbasic closed sets () with the fip such that for every ”.
   2. “For every compact Loeb space (the family of all non empty closed subsets of has a choice function) and for every set X the product is compact”.
2. (: the axiom of choice restricted to families of finite sets) implies “every well ordered product of cofinite topologies is compact” and “every well ordered basic open cover of a product of cofinite topologies has a finite subcover”.
3. (: the axiom of choice restricted to countable families of finite sets) iff “every countable product of cofinite topologies is compact”.
4. (: every filter of extends to an ultrafilter) is equivalent to the proposition “for every compact Loeb space having a base of size and for every set X of size the product is compact”.

     

On ‐complete equivalence relations on the generalized Baire space

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if , then many of them are ‐complete, in particular the isomorphism relation of dense linear orders. Then we show that it is undecidable in whether or not the isomorphism relation of a certain well behaved theory (stable, NDOP, NOTOP) is ‐complete (it is, if , but can be forced not to be).     

Σ‐algebraically compact modules and ‐compact cardinals

We prove that the property characterizes Σ‐algebraically compact modules if is not ω‐measurable. Moreover, under a large cardinal assumption, we show that over any ring R where is not ω‐measurable, any free module M of ω‐measurable rank satisfies , hence the assumption on cannot be dropped in general (e.g., over small non‐right perfect rings). In this way, we extend results from a recent paper by Simion Breaz 4 .     

Definably extending partial orders in totally ordered structures

We show, for various classes of totally ordered structures , including o‐minimal and weakly o‐minimal structures, that every definable partial order on a subset of extends definably in  to a total order. This extends the result proved in 5 for and o‐minimal.     

On sequentially closed subsets of the real line in

We show:

• (i) iff every countable product of sequential metric spaces (sequentially closed subsets are closed) is a sequential metric space iff every complete metric space is Cantor complete.
• (ii) Every infinite subset X of has a countably infinite subset iff every infinite sequentially closed subset of includes an infinite closed subset.
• (iii) The statement “ is sequential” is equivalent to each one of the following propositions:

• (a) Every sequentially closed subset A of includes a countable cofinal subset C,
• (b) for every sequentially closed subset A of , is a meager subset of ,
• (c) for every sequentially closed subset A of , ,
• (d) every sequentially closed subset of is separable,
• (e) every sequentially closed subset of is Cantor complete,
• (f) every complete subspace of is Cantor complete.

     

Iteration on notation and unary functions

In the first half of the 1990s, Clote and Takeuti characterized several function complexity classes by means of the concatenation recursion on notation operators. In this paper, we borrow from computability theory well‐known techniques based on pairing functions to show that , , and functions can be characterized by means of concatenation iteration on notation. Indeed, a function class satisfying simple constraints and defined by using concatenation recursion on notation is inductively characterized by means of concatenation iteration on notation. Furthermore, , , and unary functions are inductively characterized using addition, composition, and concatenation iteration on notation.     

Totally non‐immune sets

Let be a countable first‐order language and be an ‐structure. “Definable set” means a subset of M which is ‐definable in with parameters. A set is said to be immune if it is infinite and does not contain any infinite definable subset. X is said to be partially immune if for some definable A, is immune. X is said to be totally non‐immune if for every definable A, and are not immune. Clearly every definable set is totally non‐immune. Here we ask whether the converse is true and prove that it is false for every countable structure whose class of definable sets satisfies a mild condition. We investigate further the possibility of an alternative construction of totally non‐immune non‐definable sets with the help of a subclass of immune sets, the class of cohesive sets, as well as with the help of a generalization of definable sets, the semi‐definable ones (the latter being naturally defined in models of arithmetic). Finally connections are found between totally non‐immune sets and generic classes in nonstandard models of arithmetic.     

The space of minimal structures

For a signature L with at least one constant symbol, an L‐structure is called minimal if it has no proper substructures. Let be the set of isomorphism types of minimal L‐structures. The elements of can be identified with ultrafilters of the Boolean algebra of quantifier‐free L‐sentences, and therefore one can define a Stone topology on . This topology on generalizes the topology of the space of n‐marked groups. We introduce a natural ultrametric on , and show that the Stone topology on coincides with the topology of the ultrametric space iff the ultrametric space is compact iff L is locally finite (that is, L contains finitely many n‐ary symbols for any ). As one of the applications of compactness of the Stone topology on , we prove compactness of certain classes of metric spaces in the Gromov‐Hausdorff topology. This slightly refines the known result based on Gromov's ideas that any uniformly totally bounded class of compact metric spaces is precompact.     

Maximal cofinitary groups revisited

Let κ be an arbitrary regular infinite cardinal and let denote the set of κ‐maximal cofinitary groups. We show that if holds and C is a closed set of cardinals such that

• 1. , ,
• 2. if then ,
• 3. ,

then there is a generic extension in which cofinalities have not been changed and such that . The theorem generalizes a result of Brendle, Spinas and Zhang (cf. 4 ) regarding the possible sizes of maximal cofinitary groups. Our techniques easily modify to provide analogous results for the spectra of maximal κ‐almost disjoint families in , maximal families of κ‐almost disjoint permutations on κ and maximal families of κ‐almost disjoint functions in . In addition we construct a κ‐Cohen indestructible κ‐maximal cofinitary group and so establish the consistency of , which for is due to Yi Zhang (cf. 10 ).