Year:

  1.  3
    Self-Embeddings of Models of Peano Arithmetic.Saeideh Bahrami - 2019 - Bulletin of Symbolic Logic 25 (2):217-218.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  13
    Foundations of Online Structure Theory.Nikolay Bazhenov, Rod Downey, Iskander Kalimullin & Alexander Melnikov - 2019 - Bulletin of Symbolic Logic 25 (2):141-181.
    The survey contains a detailed discussion of methods and results in the new emerging area of online “punctual” structure theory. We also state several open problems.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  4
    A Theory of Stationary Trees and the Balanced Baumgartner–Hajnal–Todorcevic Theorem for Trees.Ari Meir Brodsky - 2019 - Bulletin of Symbolic Logic 25 (2):219-219.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  1
    Regular Tree Languages in the First Two Levels of the Borel Hierarchy.Filippo Cavallari - 2019 - Bulletin of Symbolic Logic 25 (2):221-222.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  8
    Indirect Proof and Inversions of Syllogisms.Roy Dyckhoff - 2019 - Bulletin of Symbolic Logic 25 (2):196-207.
    By considering the new notion of the inverses of syllogisms such as Barbara and Celarent, we show how the rule of Indirect Proof, in the form used by Aristotle, may be dispensed with, in a system comprising four basic rules of subalternation or conversion and six basic syllogisms.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  5
    Self-Similarity in the Foundations.Paul K. Gorbow - 2019 - Bulletin of Symbolic Logic 25 (2):216-217.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  10
    A Conjectural Classification of Strongly Dependent Fields.Yatir Halevi, Assaf Hasson & Franziska Jahnke - 2019 - Bulletin of Symbolic Logic 25 (2):182-195.
    We survey the history of Shelah’s conjecture on strongly dependent fields, give an equivalent formulation in terms of a classification of strongly dependent fields and prove that the conjecture implies that every strongly dependent field has finite dp-rank.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  3
    Creatures and Cardinals.Lukas Daniel Klausner - 2019 - Bulletin of Symbolic Logic 25 (2):218-219.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  3
    Vaught’s Two-Cardinal Theorem and Notions of Minimality in Continuous Logic.Victoria Noquez - 2019 - Bulletin of Symbolic Logic 25 (2):215-216.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  8
    Explicit Computational Paths in Type Theory.Arthur Freitas Ramos - 2019 - Bulletin of Symbolic Logic 25 (2):213-214.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  3
    Formalization of Context-Free Language Theory.Marcus Vinícius Midena Ramos - 2019 - Bulletin of Symbolic Logic 25 (2):214-214.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  1
    Completeness of Finite-Rank Differential Varieties.William D. Simmons - 2019 - Bulletin of Symbolic Logic 25 (2):220-221.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  12
    New Directions for Neo-Logicism.Aaron Thomas-Bolduc - 2019 - Bulletin of Symbolic Logic 25 (2):219-220.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14.  3
    Some Applications of Set Theory to Model Theory.Douglas Ulrich - 2019 - Bulletin of Symbolic Logic 25 (2):214-215.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  12
    An Extension of a Theorem of Zermelo.Jouko Väänänen - 2019 - Bulletin of Symbolic Logic 25 (2):208-212.
    We show that if $$ satisfies the first-order Zermelo–Fraenkel axioms of set theory when the membership relation is ${ \in _1}$ and also when the membership relation is ${ \in _2}$, and in both cases the formulas are allowed to contain both ${ \in _1}$ and ${ \in _2}$, then $\left \cong \left$, and the isomorphism is definable in $$. This extends Zermelo’s 1930 theorem in [6].
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  9
    J. H. Schmerl, Subsets Coded in Elementary End Extensions. Archive for Mathematical Logic, Vol. 53 , No. 5–6, Pp. 571–581. - J. H. Schmerl, Minimal Elementary End Extensions. Archive for Mathematical Logic, Vol. 56 , No. 5–6, Pp. 541–553. [REVIEW]Athar Abdul-Quader - 2019 - Bulletin of Symbolic Logic 25 (1):125-126.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  4
    Henkin Constructions of Models with Size Continuum.John T. Baldwin & Michael C. Laskowski - 2019 - Bulletin of Symbolic Logic 25 (1):1-33.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  9
    Nominalistic Ordinals, Recursion on Higher Types, and Finitism.Maria Hämeen-Anttila - 2019 - Bulletin of Symbolic Logic 25 (1):101-124.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  14
    An Invitation to Model Theory and C*-Algebras.Martino Lupini - 2019 - Bulletin of Symbolic Logic 25 (1):34-100.
    We present an introductory survey to first order logic for metric structures and its applications to C*-algebras.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
 Previous issues
  
Next issues