Let $\kappa$ be an inaccessible cardinal. Recall that $\kappa$ is weakly compact if every tree of height $\kappa$ has either a level of size $\kappa$ or a branch of size $\kappa$.
So if $\kappa$ is a weakly compact cardinal, one has some way of controlling the behavior of trees of size $\kappa$.
Question 1: Are there analogous large cardinal properties which allow one to control the behavior of posets which are not trees? For example, complete Boolean algebras? Distributive lattices?
Question 2: Alternatively, can the tree property already be used to control the size of more general posets, such as lattices?
What I would like is to know that if I have a nice lattice $L$ of cardinality $\leq \kappa$, then under some condition on $\kappa$, there are properties of $L$ which I can check, among which would be the condition of having no $\kappa$-sized branch, implying that $L$ is in fact of cardinality $<\kappa$.