lattice
发表于 2025-4-1 02:29:46
http://reply.papertrans.cn/17/1663/166238/166238_61.png
阻挠
发表于 2025-4-1 10:02:55
Weak , with Path Quantifiers over Infinite TreesThis paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier . and quantification over infinite paths. The proof is by reduction to emptiness for a certain automaton model, while emptiness for the automaton model is decided using profinite trees.
Confidential
发表于 2025-4-1 12:59:43
Piecewise Boolean Algebras and Their DomainsWe characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise Boolean domains equipped with an orientation, or as full structure sheaves on piecewise Boolean domains.
LEERY
发表于 2025-4-1 18:23:15
http://reply.papertrans.cn/17/1663/166238/166238_64.png