10 results
Subexponentials in non-commutative linear logic
-
- Journal:
- Mathematical Structures in Computer Science / Volume 29 / Issue 8 / September 2019
- Published online by Cambridge University Press:
- 02 May 2018, pp. 1217-1249
-
- Article
- Export citation
A rewriting framework and logic for activities subject to regulations
-
- Journal:
- Mathematical Structures in Computer Science / Volume 27 / Issue 3 / March 2017
- Published online by Cambridge University Press:
- 02 June 2015, pp. 332-375
-
- Article
- Export citation
18th Workshop on Logic, Language, Information and Computation (Wollic 2011)
-
- Journal:
- Bulletin of Symbolic Logic / Volume 18 / Issue 1 / March 2012
- Published online by Cambridge University Press:
- 15 January 2014, pp. 152-153
- Print publication:
- March 2012
-
- Article
- Export citation
2001 Annual Meeting of the Association for Symbolic Logic
-
- Journal:
- Bulletin of Symbolic Logic / Volume 7 / Issue 3 / September 2001
- Published online by Cambridge University Press:
- 15 January 2014, pp. 420-435
- Print publication:
- September 2001
-
- Article
- Export citation
Linear Logic Proof Games and Optimization
-
- Journal:
- Bulletin of Symbolic Logic / Volume 2 / Issue 3 / September 1996
- Published online by Cambridge University Press:
- 15 January 2014, pp. 322-338
- Print publication:
- September 1996
-
- Article
- Export citation
A. A. Markov and N. M. Nagorny. The theory of algorithms. English translation by M. Greendlinger of Teoriya algorifmov. Mathematics and its applications (Soviet series). Kluwer Academic Publishers, Dordrecht, Boston, and London, 1988, xxiv + 369 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 56 / Issue 1 / March 1991
- Published online by Cambridge University Press:
- 12 March 2014, pp. 336-337
- Print publication:
- March 1991
-
- Article
- Export citation
Decompositions of finitely generated modules over C(X): sheaf semantics and a decision procedure
-
- Journal:
- Mathematical Proceedings of the Cambridge Philosophical Society / Volume 103 / Issue 2 / March 1988
- Published online by Cambridge University Press:
- 24 October 2008, pp. 257-268
- Print publication:
- March 1988
-
- Article
- Export citation
G. E. Mints. E theorems. Journal of Soviet mathematics, vol. 8 (1977), pp. 323–329. (English translation of O E-téorémah, Isslédovania po konstruktivnoj matématiké i matématičéskoj logiké, VI, edited by Ú. V. Matiásévič and A. O. Slisénko, Zapiski naučnyh séminarov, vol. 40, Matématičéskij Institut im. V. A. Stéklova, Léningradskoé Otdélénié, Leningrad 1974, pp. 110–118.) - G. É. Minc. Ustojčivost' E-téorém i provérka programm (Stability of E-theorems and program verification). Sémiotika i informatika, vol. 12 (1979), pp. 73–77. - Justus Diller. Functional interpretations of Heyting's arithmetic in all finite types. Nieuw archief voor wiskunde, ser. 3 vol. 27 (1979), pp. 70–97. - Martin Stein. Interpretations of Heyting's arithmetic—an analysis by means of a language with set symbols. Annals of mathematical logic, vol. 19 (1980), pp. 1–31. - Martin Stein. A general theorem on existence theorems. Zeitschrifi für mathematische Logik und Grundlagen der Mathematik, vol. 27 (1981), pp. 435–452.
-
- Journal:
- The Journal of Symbolic Logic / Volume 52 / Issue 2 / June 1987
- Published online by Cambridge University Press:
- 12 March 2014, p. 561
- Print publication:
- June 1987
-
- Article
- Export citation
Small decidable sheaves
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 3 / September 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 726-731
- Print publication:
- September 1986
-
- Article
- Export citation
Some properties of epistemic set theory with collection
-
- Journal:
- The Journal of Symbolic Logic / Volume 51 / Issue 3 / September 1986
- Published online by Cambridge University Press:
- 12 March 2014, pp. 748-754
- Print publication:
- September 1986
-
- Article
- Export citation