On decidable varieties of Heyting algebrasDUBHASHI, D. P.The Journal of symbolic logic. 1992, Vol 57, Num 3, pp 988-991, issn 0022-4812Article

Kolmogorov entropy in the context of computability theoryMUCHNIK, Andrej A; POSITSELSKY, Semen Ye.Theoretical computer science. 2002, Vol 271, Num 1-2, pp 15-35, issn 0304-3975Article

Hierarchies of decidable extensions of bounded quantificationVorobyov, Sergei.1994, 29 p.Report

Inductionless induction based on conditional rewriting and decision proceduresVorobyov, Sergei G.1992, 16 p.Report

The laterality problem for non-erasing turing machines on {0,1} is completely solvedMARGENSTERN, M.Informatique théorique et applications (Imprimé). 1997, Vol 31, Num 2, pp 159-204, issn 0988-3754Article

Polymorphic typing with subtyping proof normalization and least type for the F≤ cloneVorobyov, Sergei.1994, 14 p.Report

A note on the decidability of ML5 extended with the powerset operatorFERRO, A.Communications on pure and applied mathematics. 1985, Vol 38, Num 4, pp 367-374, issn 0010-3640Article

Decidable regularly closed fields of algebraic numbersVAN DEN DRIES, L; SMITH, R. L.The Journal of symbolic logic. 1985, Vol 50, Num 2, pp 468-475, issn 0022-4812Article

Undecidability and intractability in theoretical physicsWOLFRAM, S.Physical review letters. 1985, Vol 54, Num 8, pp 735-738, issn 0031-9007Article

Some applications of Nevanlinna theory to mathematical logic: identities of exponential functionsHENSON, C. W; RUBEL, L. A.Transactions of the American Mathematical Society. 1984, Vol 282, Num 1, pp 1-32, issn 0002-9947Article

Decidable properties of finite sets of equations in trivial languagesKALFA, C.The Journal of symbolic logic. 1984, Vol 49, Num 4, pp 1333-1338, issn 0022-4812Article

The unsolvability of the Gödel class with identityGOLDFARB, W. D.The Journal of symbolic logic. 1984, Vol 49, Num 4, pp 1237-1261, issn 0022-4812Article

Extensions of F≤ with decidable typingVorobyov, Sergei.1994, 29 p.Report

Degrees of indiscermibles in decidable modelsKIERSTEAD, H. A; REMMEL, J. B.Transactions of the American Mathematical Society. 1985, Vol 289, Num 1, pp 41-57, issn 0002-9947Article

Co-immune subspaces and complementation in V_∞DOWNEY, R.The Journal of symbolic logic. 1984, Vol 49, Num 2, pp 528-538, issn 0022-4812Article

The undecidability of entailment and relevant implicationURQUHART, A.The Journal of symbolic logic. 1984, Vol 49, Num 4, pp 1059-1073, issn 0022-4812Article

Flexible matchingsBARTHA, Miklos; KRESZ, Miklos.Lecture notes in computer science. 2006, pp 313-324, issn 0302-9743, isbn 3-540-48381-0, 12 p.Conference Paper

The joinability and unification problems for confluent semi-constructor TRSsMITSUHASHI, Ichiro; OYAMAGUCHI, Michio; OHTA, Yoshikatsu et al.Lecture notes in computer science. 2004, pp 285-300, issn 0302-9743, isbn 3-540-22153-0, 16 p.Conference Paper

Retracts in simple typesPADOVANI, Vincent.Lecture notes in computer science. 2001, pp 376-384, issn 0302-9743, isbn 3-540-41960-8Conference Paper

The Gödel class with identity is unsolvableGOLDFARB, W. D.Bulletin, new series, of the American Mathematical Society. 1984, Vol 10, Num 1, pp 113-115, issn 0273-0979Article

Random models and the Gödel case of the decision problemGUREVICH, Y; SHELAH, S.The Journal of symbolic logic. 1973, Vol 48, Num 4, pp 1120-1124, issn 0022-4812Article

On number systems with finite degree of ambiguityHONKALA, J.Information and computation (Print). 1998, Vol 145, Num 1, pp 51-63, issn 0890-5401Article

Slender Siromoney matrix languagesSTIEBE, Ralf.Information and computation (Print). 2008, Vol 206, Num 9-10, pp 1248-1258, issn 0890-5401, 11 p.Conference Paper

Extension of the decidability of the marked PCP to instances with unique blocksHALAVA, Vesa; HARJU, Tero; KARHUMÄKI, Juhani et al.Theoretical computer science. 2007, Vol 380, Num 3, pp 355-362, issn 0304-3975, 8 p.Conference Paper

Deciding knowledge in security protocols under equational thooriesABADI, Manin; CORTIER, Véronique.Theoretical computer science. 2006, Vol 367, Num 1-2, pp 2-32, issn 0304-3975, 31 p.Conference Paper