SIGMA ₁¹-FORMULAE ON FINITE STRUCTURESAJTAI M.1983; ANNALS OF MATHEMATICAL LOGIC; ISSN 0003-4843; NLD; DA. 1983; VOL. 24; NO 1; PP. 1-48; BIBL. 3 REF.Article

MONADIC THEORY OF ORDER AND TOPOLOGY IN ZFCGUREVICH Y; SHELAH S.1982; ANNALS OF MATHEMATICAL LOGIC; ISSN 0003-4843; NLD; DA. 1982; VOL. 23; NO 2-3; PP. 179-198; BIBL. 12 REF.Article

Interpreting second-order logic in the monadic theory of orderGUREVICH, Y; SHELAH, S.The Journal of symbolic logic. 1983, Vol 48, Num 3, pp 816-828, issn 0022-4812Article

THE COMPLEXITY OF AUTOMATA AND SUBTHEORIES OF MONADIC SECOND ORDER ARITHMETICSMOSTOWSKI AW.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 453-466; BIBL. 19 REF.Conference Paper

UNPROVABILITY OF THEOREMS OF COMPLEXITY THEORY IN WEAK NUMBER THEORIESLEIVANT D.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 3; PP. 259-268; BIBL. 19 REF.Article

Lower bound results on lengths of second-order formulasSCARPELLINI, B; HARTMANIS, J.Annals of pure and applied logic. 1985, Vol 29, Num 1, pp 29-58, issn 0168-0072Article

CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR ADDITION SYSTEMSMULLER DE; SCHUPP PE.1981; BULL. AM. MATH. SOC.; ISSN 0002-9904; USA; DA. 1981; VOL. 4; NO 3; PP. 331-334; BIBL. 4 REF.Article

Monadic second-order evaluations on tree-decomposable graphsCOURCELLE, B; MOSBAH, M.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 49-82, issn 0304-3975Conference Paper

Expressive power of monadic second-order logic and modal μ-calculusROHDE, Philipp.Lecture notes in computer science. 2002, pp 239-259, issn 0302-9743, isbn 3-540-00388-6, 21 p.Conference Paper

Expressiveness and completeness of an interval tense logicVENEMA, Y.Notre Dame journal of formal logic. 1990, Vol 31, Num 4, pp 529-547, issn 0029-4527Article

Formalizing Dijkstra's predicate transformer wp in weak second-order logicBERGHAMMER, R; ELBL, B; SCHMERL, U et al.Theoretical computer science. 1995, Vol 146, Num 1-2, pp 185-197, issn 0304-3975Article

An algebraic account of modularity in ID-logicVENNEKENS, Joost; DENECKER, Marc.Lecture notes in computer science. 2005, pp 291-303, issn 0302-9743, isbn 3-540-28538-5, 13 p.Conference Paper

A regular characterization of graph languages definable in monadic second-order logicENGELFRIET, J.Theoretical computer science. 1991, Vol 88, Num 1, pp 139-150, issn 0304-3975Article

Finitistic proofs of 0-1 laws for fragments of second-order logicLACOSTE, T.Information processing letters. 1996, Vol 58, Num 1, pp 1-4, issn 0020-0190Article

Querying unranked trees with stepwise tree automataCARME, Julien; NIEHREN, Joachim; TOMMASI, Marc et al.Lecture notes in computer science. 2004, pp 105-118, issn 0302-9743, isbn 3-540-22153-0, 14 p.Conference Paper

Logic in computer science (Copenhagen, 22-25 July 2002)Proceedings - Symposium on Logic in Computer Science. 2002, issn 1043-6871, isbn 0-7695-1483-9, XIII, 461 p, isbn 0-7695-1483-9Conference Proceedings

A PSPACE-complete fragment of second-order linear logicPERRIER, G.Theoretical computer science. 1999, Vol 224, Num 1-2, pp 267-289, issn 0304-3975Conference Paper

Some highly undecidable latticesMAGIDOR, M; ROSENTHAL, J. W; RUBIN, M et al.Annals of pure and applied logic. 1990, Vol 46, Num 1, pp 41-63, issn 0168-0072Article

The monadic second-order logic of graphs. I, Recognizable sets of finite graphsCOURCELLE, B.Information and computation (Print). 1990, Vol 85, Num 1, pp 12-75, issn 0890-5401Article

A bounding quantifierBOJANCZYK, Mikolaj.Lecture notes in computer science. 2004, pp 41-55, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper

A second-order theorem prover applied to circumscriptionBEESON, Michael.Lecture notes in computer science. 2001, pp 318-324, issn 0302-9743, isbn 3-540-42254-4Conference Paper

A foundational delineation of poly-timeLEIVANT, D.Information and computation (Print). 1994, Vol 110, Num 2, pp 391-420, issn 0890-5401Article

Decidable theories of the ordering of natural numbers with unary predicatesRABINOVICH, Alexander; THOMAS, Wolfgang.Lecture notes in computer science. 2006, pp 562-574, issn 0302-9743, isbn 3-540-45458-6, 1Vol, 13 p.Conference Paper

The modular decomposition of countable graphs : Constructions in monadic second-order logicCOURCELLE, Bruno; DELHOMME, Christian.Lecture notes in computer science. 2005, pp 325-338, issn 0302-9743, isbn 3-540-28231-9, 14 p.Conference Paper

The complexity of independence-friendly fixpoint logicBRADFIELD, Julian; KREUTZER, Stephan.Lecture notes in computer science. 2005, pp 355-368, issn 0302-9743, isbn 3-540-28231-9, 14 p.Conference Paper