scientific article
From MaRDI portal
Publication:3757893
zbMath0621.03007MaRDI QIDQ3757893
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidabilityreduction algorithmcolored treesbranching time logicPASTUNTILbinary connectivesbranch variablesBTLFUTURENECESSARYreduction of formal theoriesSINCEtheory of trees with quantification over nodes and branchestrees with additional unary predicatesunary connectives
Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)
Related Items (6)
Notes on monadic logic. A: Monadic theory of the real line ⋮ Counting on CTL\(^*\): On the expressive power of monadic path logic ⋮ Notes on monadic logic. Part B: Complexity of linear orders in ZFC ⋮ More on monadic logic. C: Monadically interpreting in stable unsuperstable \(\mathcal T\) and the monadic theory of \(^{\omega}\lambda\) ⋮ Arity hierarchy for temporal logics ⋮ APPROXIMATING TREES AS COLOURED LINEAR ORDERS AND COMPLETE AXIOMATISATIONS OF SOME CLASSES OF TREES
This page was built for publication:
