Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Bulletin of Symbolic Logic
  4. Content listing
Journal Home

Refine listing

Refine listing

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals: Show more
Publishers: Show more
Societies: Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1635 results in Bulletin of Symbolic Logic

Page 1 of 82

  • POUR-EL’S LANDSCAPE

  • TAISHI KURAHASHI, ALBERT VISSER
  • Journal:
    Bulletin of Symbolic Logic / Accepted manuscript
    Published online by Cambridge University Press:
    09 May 2024, pp. 1-36
    • Article
      • You have access
    • PDF
    • Export citation

  • ONE-VARIABLE FRAGMENTS OF FIRST-ORDER LOGICS

  • PETR CINTULA, GEORGE METCALFE, NAOMI TOKUDA
  • Journal:
    Bulletin of Symbolic Logic / Accepted manuscript
    Published online by Cambridge University Press:
    01 April 2024, pp. 1-23
    • Article
      • You have access
    • PDF
    • Export citation

  • ASSOCIATION FOR SYMBOLIC LOGIC

  • Journal:
    Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
    Published online by Cambridge University Press:
    02 April 2024, pp. 176-180
    Print publication:
    March 2024
    • Article
      • You have access
    • PDF
    • HTML
    • Export citation

  • BSL volume 30 issue 1 Cover and Front matter

  • Journal:
    Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
    Published online by Cambridge University Press:
    02 April 2024, pp. f1-f3
    Print publication:
    March 2024
    • Article
      • You have access
    • PDF
    • Export citation

  • BSL volume 30 issue 1 Cover and Back matter

  • Journal:
    Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
    Published online by Cambridge University Press:
    02 April 2024, pp. b1-b5
    Print publication:
    March 2024
    • Article
      • You have access
    • PDF
    • Export citation

  • VERY LARGE SET AXIOMS OVER CONSTRUCTIVE SET THEORIES

  • HANUL JEON, RICHARD MATTHEWS
  • Journal:
    Bulletin of Symbolic Logic / Accepted manuscript
    Published online by Cambridge University Press:
    26 February 2024, pp. 1-70
    • Article
      • You have access
    • PDF
    • Export citation

  • THE UNIVERSAL THEORY OF THE HYPERFINITE II1 FACTOR IS NOT COMPUTABLE

  • ISAAC GOLDBRING, BRADD HART
  • Journal:
    Bulletin of Symbolic Logic / Accepted manuscript
    Published online by Cambridge University Press:
    16 February 2024, pp. 1-18
    • Article
      • You have access
    • PDF
    • Export citation

  • CATEGORICAL QUANTIFICATION

  • CONSTANTIN C. BRÎNCUȘ
  • Journal:
    Bulletin of Symbolic Logic / Accepted manuscript
    Published online by Cambridge University Press:
    24 January 2024, pp. 1-27
    • Article
      • You have access
    • PDF
    • Export citation

  • A WALK WITH GOODSTEIN

  • Part of:
  • DAVID FERNÁNDEZ-DUQUE, ANDREAS WEIERMANN
  • Journal:
    Bulletin of Symbolic Logic / Volume 30 / Issue 1 / March 2024
    Published online by Cambridge University Press:
    17 January 2024, pp. 1-19
    Print publication:
    March 2024
    • Article
      • You have access
    • PDF
    • HTML
    • Export citation

  • Goodstein’s principle is arguably the first purely number-theoretic statement known to be independent of Peano arithmetic. It involves sequences of natural numbers which at first appear to diverge, but eventually decrease to zero. These sequences are defined relative to a notation system based on exponentiation for the natural numbers. In this article, we provide a self-contained and modern analysis of Goodstein’s principle, obtaining some variations and improvements. We explore notions of optimality for notation systems and apply them to the classical Goodstein process and to a weaker variant based on multiplication rather than exponentiation. In particular, we introduce the notion of base-change maximality, and show how it leads to far-reaching extensions of Goodstein’s result. We moreover show that by varying the initial base of the Goodstein process, one readily obtains independence results for each of the fragments $\mathsf {I}\Sigma _n$ of Peano arithmetic.

  • BSL volume 29 issue 4 Cover and Back matter

  • Journal:
    Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
    Published online by Cambridge University Press:
    23 February 2024, pp. b1-b2
    Print publication:
    December 2023
    • Article
      • You have access
    • PDF
    • Export citation

  • Computability Theory: Constructive Applications of the Lefthanded Local Lemma and Characterizations of Some Classes of Cohesive Powers

  • Part of:
  • Daniel Mourad
  • Journal:
    Bulletin of Symbolic Logic / Volume 29 / Issue 4 / December 2023
    Published online by Cambridge University Press:
    23 February 2024, pp. 664-665
    Print publication:
    December 2023
    • Article
      • You have access
    • PDF
    • Export citation

  • The Lovász local lemma (LLL) is a technique from combinatorics for proving existential results. There are many different versions of the LLL. One of them, the lefthanded local lemma, is particularly well suited for applications to two player games. There are also constructive and computable versions of the LLL. The chief object of this thesis is to prove an effective version of the lefthanded local lemma and to apply it to effectivise constructions of non-repetitive sequences.

    The second goal of this thesis is to categorize some classes of cohesive powers. We completely describe both the isomorphism types of cohesive powers of equivalence structures and injection structures, as well as clarify the relationship between these cohesive powers and their original structures. We also describe the finite condensation of cohesive powers of computable copies of the integers as a linear order by cohesive sets whose complement are computably enumerable.

    Finally, we investigate the possibility of decomposing problems in the Weihrauch degrees into a product of first order part and second order part. We give a preliminary result in this direction.

    Abstract prepared by Daniel Mourad.

    E-mail: [email protected]

    URL: https://daniel-mourad.scholar.uconn.edu/wp-content/uploads/sites/2530/2023/06/ThesisFinalWithRevisions-2.pdf

Page 1 of 82