Mathematical Logic Quarterly最新文献

We define a property of forcing notions and show that there exists a model of its forcing axiom and the negation of the continuum hypothesis in which the Cichoń-Blass diagram of cardinal invariants is the same as in the Cohen model. As a corollary, its forcing axiom and the forcing axiom for $�\sigma$-centered forcing notions are independent of each other.

The present paper deals with a purely syntactic analysis of infinitary logic with infinite sequents. In particular, we discuss sequent calculi for classical and intuitionistic infinitary logic with good structural properties based on sequents possibly containing infinitely many formulas. A cut admissibility proof is proposed which employs a new strategy and a new inductive parameter. We conclude the paper by discussing related issues and possible themes for future research.

We prove a dichotomy for o-minimal fields $�R$, expanded by a $�T$-convex valuation ring (where $�T$ is the theory of $�R$) and a compatible monomial group. We show that if $�T$ is power bounded, then this expansion of $�R$ is model complete (assuming that $�T$ is), it has a distal theory, and the definable sets are geometrically tame. On the other hand, if $�R$ defines an exponential function, then the natural numbers are externally definable in our expansion, precluding any sort of model-theoretic tameness.

Using properties of simple sets we study $�{�b�Q�}_1$-degrees of c.e. sets. In particular, we prove: (1) If $�A$ and $�B$ are c.e. sets, $�A$ is a simple set and $��A�{\le }_{{�b�Q�}_1}�B�$, then there exists a simple set $�C$ such that $��C�{\le }_1�A�$ and $��C�{\le }_1�B�$. (2) the c.e. $�{�b�Q�}_1$-degrees ($�{�b�Q�}_1$-degrees) do not form an up

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this logic enjoys a weak version of the fixed point property. Secondly, we introduce a system of sequent calculus and prove the cut-elimination theorem for it. As a consequence, we prove that the logic enjoys the Craig interpolation property. Thirdly, we show that the logic is the natural basis of a generalization of simplified Veltman semantics, and prove that it has the finite frame property with respect to that semantics. Finally, we prove that it is sound and complete with respect to some appropriate arithmetical semantics.

I consider the natural infinitary variations of the games Wordle and Mastermind, as well as their game-theoretic variations Absurdle and Madstermind, considering these games with infinitely long words and infinite color sequences and allowing transfinite game play. For each game, a secret codeword is hidden, which the codebreaker attempts to discover by making a series of guesses and receiving feedback as to their accuracy. In Wordle with words of any size from a finite alphabet of n letters, including infinite words or even uncountable words, the codebreaker can nevertheless always win in n steps. Meanwhile, the mastermind number $�m$, defined as the smallest winning set of guesses in infinite Mastermind for sequences of length ω over a countable set of colors without duplication, is uncountable, but the exact value turns out to be independent of $�\mathrm{ZFC}$, for it is provably equal to the eventually different number $��d�\left(�{\ne }^{\ast }�\right)�$, which is the same as the covering number of the meager ideal $���\text{cov}��\left(�M�\right)�$. I thus place all the various mastermind numbers, defined for the natural variations of the game, into the hierarchy of cardinal characteristics of the continuum.

We show that the predicate “x is the power set of y” is $��{\Sigma }_1��(�Card�)��$-definable, if V = L[E] is an extender model constructed from a coherent sequences of extenders, provided that there is no inner model with a Woodin cardinal. Here $�Card$ is a predicate true of just the infinite cardinals. From this we conclude: the validities of second order logic are reducible to $�V_I$, the set of validities of the Härtig quantifier logic. Further we show that if no L[E] model has a cardinal strong up to one of its ℵ-fixed points, and $�{\ell }_I$, the Löwenheim number of this logic, is less than the least weakly inaccessible δ, then (i) $�{\ell }_I$ is a limit of measurable cardinals of K, and (ii) the Weak Covering Lemma holds at δ.

In this paper, we prove several results about the Turing jumps of low c.e. sets. We show that only Δ-levels of the Ershov Hierarchy can properly contain the Turing jumps of c.e. sets and that there exists an arbitrarily large computable ordinal with a normal notation such that the corresponding Δ-level is proper for the Turing jump of some c.e. set. Next, we generalize the notion of jump traceability to the jump traceability with $�{\Sigma }_{\alpha }^{�-�1�}$- and $�{\Delta }_{\alpha }^{�-�1�}$-bound for every infinite computable ordinal α. It is known that jump traceability and superlowness coincide on the c.e. sets and we show that for every infinite computable ordinal α, jump traceability with $�{\Sigma }_{\alpha }^{�-�1�}$- or $�{\Delta }_{\alpha }^{�-�1�}$-bound of a c.e. set A is equivalent to the fact that $��A^{\prime }�\in �{\Delta }_{\alpha }^{�-�1�}�$. Finally, we consider the generalized truth-table reducibilities $�{⩽}_{�g�t�t�(�}$

We give a formalism for approximate isomorphism in continuous logic simultaneously generalizing those of two papers by Ben Yaacov [2] and by Ben Yaacov, Doucha, Nies, and Tsankov [6], which are largely incompatible. With this we explicitly exhibit Scott sentences for the perturbation systems of the former paper, such as the Banach-Mazur distance and the Lipschitz distance between metric spaces. Our formalism is simultaneously characterized syntactically by a mild generalization of perturbation systems and semantically by certain elementary classes of two-sorted structures that witness approximate isomorphism. As an application, we show that the theory of any $�R$-tree or ultrametric space of finite radius is stable, improving a result of Carlisle and Henson [8].