Journal of Symbolic Logic · 1987 · 38 citations · 6 references
Natural SciencesComputer ScienceMathematicsAlgebraSet TheoryTheory Of ComputationBoolean AlgebraFirst-order LogicModel TheoryPartial OrdersPredicate LogicMonadic Second-order LogicMonads
Abstract Let S2S [WS2S] respectively be the strong [weak] monadic second order theory of the binary tree T in the language of two successor functions. An S2S-formula whose free variables are just individual variables defines a relation on T (rather than on the power set of T ). We show that S2S and WS2S define the same relations on T , and we give a simple characterization of these relations.
6
Transductions and Context-Free Languages
Jean Berstel · 1979 · 1.3K citations
Yuri Gurevich, Leo Harrington · 1982 · 326 citations