Titlebook: Automata, Languages, and Programming; 41st International C Javier Esparza,Pierre Fraigniaud,Elias Koutsoupias Conference proceedings 2014 S

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 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.

只看該作者 · 發(fā)表于 2025-4-1 18:23:15

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-10 05:05
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved