◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Shira Yadai

4 papers hereh-index 311 citations5 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author2
  • last author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • math.LO4

identity via Semantic Scholar / OpenAlex

activity
20232025
collaborators

4 papers

math.LO2025

The power of trees

Ari Meir Brodsky, Assaf Rinot, Shira Yadai

We give two consistent constructions of trees T whose finite power Tn+1 is sharply different from Tn: 1. An ℵ1​-tree T whose interval topology XT​ is perfectly…

math.LO2024

Proxy principles in combinatorial set theory

Ari Meir Brodsky, Assaf Rinot, Shira Yadai

The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of κ-Souslin trees in a uniform way that does not…

math.LO2023

The vanishing levels of a tree

Assaf Rinot, Shira Yadai, Zhixing You

We initiate the study of the spectrum Vspec(κ) of sets that can be realized as the vanishing levels V(T) of a normal κ-tree T. The latter is an invariant in the sense that…

math.LO2023

Full Souslin trees at small cardinals

Assaf Rinot, Shira Yadai, Zhixing You

A κ-tree is said to be full if each of its limit levels omits no more than one potential branch. Kunen asked whether a full κ-Souslin tree may consistently exist. Shelah gave a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.