Abstract is missing.
- Applications of Finite Duality to Locally Finite Varieties of BL-AlgebrasStefano Aguzzoli, Simone Bova, Vincenzo Marra. 1-15 [doi]
- Completeness Results for Memory LogicsCarlos Areces, Santiago Figueira, Sergio Mera. 16-30 [doi]
- Canonical Signed Calculi, Non-deterministic Matrices and Cut-EliminationArnon Avron, Anna Zamansky. 31-45 [doi]
- Temporalization of Probabilistic Propositional LogicPedro Baltazar, Paulo Mateus. 46-60 [doi]
- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear OrderingsNicolas Bedon. 61-75 [doi]
- The Logic of Proofs as a Foundation for Certifying Mobile ComputationEduardo Bonelli, Federico Feller. 76-91 [doi]
- ATLwith Strategy Contexts and Bounded MemoryThomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey. 92-106 [doi]
- A Relational Model of a Parallel and Non-deterministic lambda-CalculusAntonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto. 107-121 [doi]
- The NP-Completeness of Reflected Fragments of Justification LogicsSamuel R. Buss, Roman Kuznets. 122-136 [doi]
- Taming Modal Impredicativity: Superlazy ReductionUgo Dal Lago, Luca Roversi, Luca Vercelli. 137-151 [doi]
- Positive Fork Graph CalculusRenata P. de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Jorge Petrúcio Viana. 152-163 [doi]
- Games on Strings with a Limited Order RelationElisabetta De Maria, Angelo Montanari, Nicola Vitacolonna. 164-179 [doi]
- Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite TreesAmélie Gheerbrant, Balder ten Cate. 180-196 [doi]
- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic LogicValentin Goranko, Dmitry Shkatov. 197-213 [doi]
- A Clausal Approach to Proof Analysis in Second-Order LogicStefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo. 214-229 [doi]
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate LogicsRosalie Iemhoff, George Metcalfe. 230-245 [doi]
- Light Linear Logic with Controlled WeakeningMax I. Kanovich. 246-264 [doi]
- Fuzzy Description Logic Reasoning Using a Fixpoint AlgorithmUwe Keller, Stijn Heymans. 265-279 [doi]
- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional SystemAntoine Genitrini, Jakub Kozik. 280-294 [doi]
- Tableaux and Hypersequents for Justification LogicHidenori Kurokawa. 295-308 [doi]
- Topological Forcing Semantics with SettlingRobert S. Lubarsky. 309-322 [doi]
- Automata and Answer Set ProgrammingVictor W. Marek, Jeffrey B. Remmel. 323-337 [doi]
- A Labeled Natural Deduction System for a Fragment of CTL*Andrea Masini, Luca Viganò, Marco Volpe. 338-353 [doi]
- Conservativity for Logics of Justified BeliefRobert Saxon Milnikel. 354-364 [doi]
- Unifying Sets and Programs via Dependent TypesWojciech Moczydlowski. 365-379 [doi]
- Product-Free Lambek Calculus Is NP-CompleteYury Savateev. 380-394 [doi]
- Games on Multi-stack Pushdown SystemsAnil Seth. 395-408 [doi]
- Data Privacy for Knowledge BasesPhiniki Stouppa, Thomas Studer. 409-421 [doi]
- Fixed Point Theorems on Partial RandomnessKohtaro Tadaki. 422-440 [doi]
- Decidability and Undecidability in Probability LogicSebastiaan Terwijn. 441-450 [doi]
- A Bialgebraic Approach to Automata and Formal Language TheoryJames Worthington. 451-467 [doi]