1 | -- | 0 | Sergei N. Artëmov, Anil Nerode. Special Issue on Logical Foundations of Computer Science |
3 | -- | 25 | Antonis Achilleos. Modal logics with hard diamond-free fragments |
27 | -- | 60 | Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky. An introduction to feedback Turing computability |
61 | -- | 76 | Sergei N. Artëmov. On aggregating probabilistic evidence |
77 | -- | 106 | Marco Devesas Campos, Marcelo Fiore. Classical logic with Mendler induction |
107 | -- | 156 | Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel. On the complexity of index sets for finite predicate logic programs which allow function symbols |
157 | -- | 174 | Harley Eades III, Valeria de Paiva. Multiple conclusion linear logic: cut elimination and more |
175 | -- | 192 | Nathanaël Fijalkow. Lower bounds for the state complexity of probabilistic languages and the language of prime numbers |
193 | -- | 216 | Melvin Fitting, Felipe Salvatore. First-order justification logic with constant domain semantics |
217 | -- | 238 | Henrik Forssell, Håkon Robbestad Gylterud, David I. Spivak. Type theoretical databases |
239 | -- | 256 | Max I. Kanovich, Stepan Kuznetsov, Andre Scedrov. Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities |
257 | -- | 280 | Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer. Probabilistic justification logic |
281 | -- | 294 | Vladimir N. Krupski. Cut elimination and complexity bounds for intuitionistic epistemic logic |
295 | -- | 319 | Hidenori Kurokawa, Hirohiko Kushida. Resource sharing linear logic |
321 | -- | 348 | Shoshin Nomura, Hiroakira Ono, Katsuhiko Sano. A cut-free labelled sequent calculus for dynamic epistemic logic |
349 | -- | 379 | Iosif Petrakis. Embeddings of Bishop spaces |
381 | -- | 402 | Tudor Protopopescu. An arithmetic interpretation of intuitionistic verification |
403 | -- | 420 | R. Ramanujam, Ramanathan S. Thinniyam. Definability in first-order theories of graph orderings ⋆ |
421 | -- | 445 | R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh. The complexity of disjunction in intuitionistic logic |
447 | -- | 457 | Michael Rathjen. Power Kripke-Platek set theory and the axiom of choice |
459 | -- | 524 | Sam Sanders. The unreasonable effectiveness of Nonstandard Analysis |