Journal: Journal of Logic and Computation

Volume 30, Issue 1

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