当前期刊: The Journal of Symbolic Logic Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-12
    EVAN GORIS; JOOST J. JOOSTEN

    The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.

    更新日期:2019-12-12
  • EHRENFEUCHT-FRAÏSSÉ GAMES ON A CLASS OF SCATTERED LINEAR ORDERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    FERESIANO MWESIGYE; JOHN KENNETH TRUSS

    Two structures A and B are n-equivalent if Player II has a winning strategy in the n-move Ehrenfeucht-Fraïssé game on A and B. In earlier articles we studied n-equivalence classes of ordinals and coloured ordinals. In this article we similarly treat a class of scattered order-types, focussing on monomials and sums of monomials in ω and its reverse ω*.

    更新日期:2019-12-10
  • ON THE EXISTENCE OF LARGE ANTICHAINS FOR DEFINABLE QUASI-ORDERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    BENJAMIN D. MILLER; ZOLTÁN VIDNYÁNSZKY

    We simultaneously generalize Silver’s perfect set theorem for co-analytic equivalence relations and Harrington-Marker-Shelah’s Dilworth-style perfect set theorem for Borel quasi-orders, establish the analogous theorem at the next definable cardinal, and give further generalizations under weaker definability conditions.

    更新日期:2019-12-10
  • ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    HOWARD BECKER

    Let L be a computable vocabulary, let XL be the space of L-structures with universe ω and let $f:{2^\omega } \to {X_L}$ be a hyperarithmetic function such that for all $x,y \in {2^\omega }$ , if $x{ \equiv _h}y$ then $f\left( x \right) \cong f\left( y \right)$ . One of the following two properties must hold. (1) The Scott rank of f (0) is $\omega _1^{CK} + 1$ . (2) For all $x \in {2^\omega },f\left(

    更新日期:2019-12-10
  • PREDICATIVE COLLAPSING PRINCIPLES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-09
    ANTON FREUND

    We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal α there exists an ordinal β such that $1 + \beta \cdot \left( {\beta + \alpha } \right)$ (ordinal arithmetic) admits an almost order preserving collapse into β. Arithmetical comprehension is equivalent to a statement of the same form, with $\beta \cdot \alpha$ at the place of

    更新日期:2019-12-09
  • SLOW P-POINT ULTRAFILTERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-26
    RENLING JIN

    We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin’s Axiom, that (1) there exists a P-point which is not interval-to-one and (2) there exists an interval-to-one P-point which is neither quasi-selective nor weakly Ramsey.

    更新日期:2019-11-26
  • THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-18
    JUAN P. AGUILERA; SANDRA MÜLLER

    We determine the consistency strength of determinacy for projective games of length ω2. Our main theorem is that $\Pi _{n + 1}^1 $ -determinacy for games of length ω2 implies the existence of a model of set theory with ω + n Woodin cardinals. In a first step, we show that this hypothesis implies that there is a countable set of reals A such that Mn (A), the canonical inner model for n Woodin cardinals

    更新日期:2019-11-18
  • A MINIMAL PAIR IN THE GENERIC DEGREES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-12
    DENIS R. HIRSCHFELDT

    We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.

    更新日期:2019-11-12
  • RESTRICTED MAD FAMILIES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-05
    OSVALDO GUZMÁN; MICHAEL HRUŠÁK; OSVALDO TÉLLEZ

    Let ${\cal I}$ be an ideal on ω. By cov ${}_{}^{\rm{*}}({\cal I})$ we denote the least size of a family ${\cal B} \subseteq {\cal I}$ such that for every infinite $X \in {\cal I}$ there is $B \in {\cal B}$ for which $B\mathop \cap \nolimits X$ is infinite. We say that an AD family ${\cal A} \subseteq {\cal I}$ is a MAD family restricted to ${\cal I}$ if for every infinite $X \in {\cal I}$ there is

    更新日期:2019-11-05
  • FACTORIALS OF INFINITE CARDINALS IN ZF PART I: ZF RESULTS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-04
    GUOZHEN SHEN; JIACHEN YUAN

    For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove in ZF (without the axiom of choice) several results concerning this notion, among which are the following:

    更新日期:2019-11-04
  • FACTORIALS OF INFINITE CARDINALS IN ZF PART II: CONSISTENCY RESULTS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-04
    GUOZHEN SHEN; JIACHEN YUAN

    For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF:

    更新日期:2019-11-04
  • TRUTH AND FEASIBLE REDUCIBILITY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-20
    ALI ENAYAT; MATEUSZ ŁEŁYK; BARTOSZ WCISŁO

    Let ${\cal T}$ be any of the three canonical truth theories CT− (compositional truth without extra induction), FS− (Friedman–Sheard truth without extra induction), or KF− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA (Peano arithmetic). We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA.

    更新日期:2019-09-20
  • INDESTRUCTIBILITY OF THE TREE PROPERTY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-16
    RADEK HONZIK; ŠÁRKA STEJSKALOVÁ

    In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$ , and λ is weakly compact, then in $V\left[M {\left( {\kappa ,\lambda } \right)} \right]$ the tree property at $$\lambda = \left( {\kappa ^{ + + } } \right)^{V\left[ {\left( {\kappa ,\lambda } \right)} \right]} $$ is indestructible under all ${\kappa ^ + }$ -cc forcing notions

    更新日期:2019-09-16
  • THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-10
    ERIC P. ASTOR; DAMIR DZHAFAROV; ANTONIO MONTALBÁN; REED SOLOMON; LINDA BROWN WESTRICK

    We define the notion of a completely determined Borel code in reverse mathematics, and consider the principle $CD - PB$ , which states that every completely determined Borel set has the property of Baire. We show that this principle is strictly weaker than $AT{R_0}$ . Any ω-model of $CD - PB$ must be closed under hyperarithmetic reduction, but $CD - PB$ is not a theory of hyperarithmetic analysis.

    更新日期:2019-09-10
  • FORCING AND THE HALPERN–LÄUCHLI THEOREM
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    NATASHA DOBRINEN; DANIEL HATHAWAY

    We investigate the effects of various forcings on several forms of the Halpern– Läuchli theorem. For inaccessible κ, we show they are preserved by forcings of size less than κ. Combining this with work of Zhang in [17] yields that the polarized partition relations associated with finite products of the κ-rationals are preserved by all forcings of size less than κ over models satisfying the Halpern–

    更新日期:2019-09-09
  • RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    ANDRÉ NIES; PAUL SHAFER

    We investigate the strength of a randomness notion ${\cal R}$ as a set-existence principle in second-order arithmetic: for each Z there is an X that is ${\cal R}$ -random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C-incompressible is provable in $RC{A_0}$ . We verify that $RC{A_0}$ proves the basic implications among randomness notions: 2-random $\Rightarrow$

    更新日期:2019-09-09
  • CHAITIN’S Ω AS A CONTINUOUS FUNCTION
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    RUPERT HÖLZL; WOLFGANG MERKLE; JOSEPH MILLER; FRANK STEPHAN; LIANG YU

    We prove that the continuous function ${\rm{\hat \Omega }}:2^\omega \to $ that is defined via $X \mapsto \mathop \sum \limits_n 2^{ - K\left( {Xn} \right)} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left( X \right)\,{\rm{d}}X$ is

    更新日期:2019-09-09
  • CHOICE-FREE STONE DUALITY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    NICK BEZHANISHVILI; WESLEY H. HOLLIDAY

    The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices

    更新日期:2019-08-29
  • THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    JACQUES DUPARC; LOUIS VUILLEUMIER

    We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets $\mathbb{P}_{emb} $ equipped with the order induced by homomorphisms is embedded into the Wadge order on the $\Delta _2^0 $ -degrees of the Scott domain. We then show

    更新日期:2019-08-29
  • HAMEL SPACES AND DISTAL EXPANSIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    ALLEN GEHRET; TRAVIS NELL

    In this note, we construct a distal expansion for the structure $$\left( {; + , < ,H} \right)$$ , where $H \subseteq $ is a dense $Q$ -vector space basis of $R$ (a so-called Hamel basis). Our construction is also an expansion of the dense pair $\left( {; + , < ,} \right)$ and has full quantifier elimination in a natural language.

    更新日期:2019-08-29
  • MULTIPLE CHOICES IMPLY THE INGLETON AND KREIN–MILMAN AXIOMS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-07-12
    MARIANNE MORILLON

    In set theory without the Axiom of Choice, we consider Ingleton’s axiom which is the ultrametric counterpart of the Hahn–Banach axiom. We show that in ZFA, i.e., in the set theory without the Axiom of Choice weakened to allow “atoms,” Ingleton’s axiom does not imply the Axiom of Choice (this solves in ZFA a question raised by van Rooij, [27]). We also prove that in ZFA, the “multiple choice” axiom

    更新日期:2019-07-12
  • ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-06-13
    URI ANDREWS; SERIKZHAN A. BADAEV

    We examine how degrees of computably enumerable equivalence relations (ceers) under computable reduction break down into isomorphism classes. Two ceers are isomorphic if there is a computable permutation of ω which reduces one to the other. As a method of focusing on nontrivial differences in isomorphism classes, we give special attention to weakly precomplete ceers. For any degree, we consider the

    更新日期:2019-06-13
  • A GAME CHARACTERIZING BAIRE CLASS 1 FUNCTIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-06-06
    VIKTOR KISS

    Duparc introduced a two-player game for a function f between zero-dimensional Polish spaces in which Player II has a winning strategy iff f is of Baire class 1. We generalize this result by defining a game for an arbitrary function f : X → Y between arbitrary Polish spaces such that Player II has a winning strategy in this game iff f is of Baire class 1. Using the strategy of Player II, we reprove

    更新日期:2019-06-06
  • COHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-05-06
    DAOUD SINIORA; SŁAWOMIR SOLECKI

    We give strengthened versions of the Herwig–Lascar and Hodkinson–Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous structures. For instance, we establish a coherent form of the extension property for partial automorphisms for certain Fraïssé classes. We deduce from these results that

    更新日期:2019-05-06
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
3分钟学术视频演讲大赛
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
麻省大学
西北大学
湖南大学
华东师范大学
王要兵
化学所
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
陆军军医大学
杨财广
廖矿标
试剂库存
down
wechat
bug