Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Polytopological models equipped with closure or derivative operators, subject to regularity conditions, are sound and strongly complete for constructive, intuitionistic, and Gödel-Dummett variants of K4 and S4.
Logical families of stable and total profunctors are definable by MLL+MIX proof-nets.
citing papers explorer
-
Automaton-based Characterisations of First Order Logic over Infinite Trees
Hesitant tree automata characterize FO over infinite trees equivalently to PolPCTL and CTLsf, yielding a normal form in PolCTLs and revealing that FO is limited to safety or co-safety per branch.
-
Polytopological Semantics for Intuitionistic Modal Logics
Polytopological models equipped with closure or derivative operators, subject to regularity conditions, are sound and strongly complete for constructive, intuitionistic, and Gödel-Dummett variants of K4 and S4.
-
Full Definability in a Profunctorial Model
Logical families of stable and total profunctors are definable by MLL+MIX proof-nets.