Journal of Logic and Computation, Volume 27

Volume 27, Number 1, 2017

Articles

• 
  Paulo Mateus, Amílcar Sernadas, André Souto:
  Universality of quantum Turing machines with deterministic control. 1-19
• 
  Mario Piazza, Gabriele Pulcini:
  Unifying logics via context-sensitiveness. 21-40
• 
  Matthew Collinson, Kevin McDonald, David J. Pym:
  Layered graph logic as an assertion language for access control policy models. 41-80
• 
  Patrick Blackburn, Thomas Bolander, Torben Braüner, Klaus Frovin Jørgensen:
  Completeness and termination for a Seligman-style tableau system. 81-107
• 
  Sebastian Eberhard, Stefan Hetzl, Daniel Weller:
  Boolean unification with predicates. 109-128
• 
  Tomás Kroupa, Bruno Teheux:
  Modal extensions of Łukasiewicz logic for modelling coalitional power. 129-154

Corner Articles

• 
  Umberto Rivieccio, Achim Jung, Ramon Jansana:
  Four-valued modal logic: Kripke semantics and duality. 155-199
• 
  Steffen Lewitzka:
  A modal logic amalgam of classical and intuitionistic propositional logic. 201-212
• 
  Hiroyuki Kido, Yukio Ohsawa, Katsumi Nitta:
  Paretian argumentation frameworks for Pareto optimal arguments. 213-225
• 
  Edmond Awad, Richard Booth, Fernando Tohmé, Iyad Rahwan:
  Judgement aggregation in multi-agent argumentation. 227-259
• 
  Salem Benferhat, Zied Bouraoui:
  Min-based possibilistic DL-Lite. 261-297
• 
  Amanda Vidal, Francesc Esteva, Lluís Godo:
  On modal extensions of Product fuzzy logic. 299-336
• 
  Milan Petrík, Thomas Vetterlein:
  Rees coextensions of finite, negative tomonoids. 337-356
• 
  Ernst-Erich Doberkat, Pedro Sánchez Terraf:
  Stochastic non-determinism and effectivity functions. 357-394
• 
  Pavel Naumov, Jia Tao:
  A modal logic for reasoning about economic policies. 395-412

Erratum

• 
  Matthew Collinson, Kevin McDonald, Simon Docherty, David J. Pym:
  Erratum to: A substructural logic for layered graphs. 413-414

Volume 27, Number 2, 2017

Special Issue: Selected papers from "Concepts and Meaning" workshop, Vienna University of Technology, 2-5 May, 2012
Preface

• 
  Matthias Baaz, Agata Ciabattoni, Dov M. Gabbay, Stefan Hetzl, Daniel Weller:
  Preface. 415

Special issue articles

• 
  Egon Börger:
  The abstract state machines method for modular design and analysis of programming languages. 417-439
• 
  Manuel Lamotte-Schubert, Christoph Weidenbach:
  BDI: a new decidable clause class. 441-468
• 
  Georg Moser:
  KBOs, ordinals, subrecursive hierarchies and all that. 469-495
• 
  Daniele Mundici, Claudia Picardi:
  Faulty sets of Boolean formulas and Łukasiewicz logic. 497-507
• 
  Hans de Nivelle:
  Theorem proving for classical logic with partial functions by reduction to Kleene logic. 509-548
• 
  Nicolas Peltier:
  A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules. 549-576
• 
  Bruno Woltzenlogel Paleo:
  Reducing redundancy in cut-elimination by resolution. 577-606

Volume 27, Number 3, April 2017

Special Issue: Canonicity and Correspondence for Nonclassical Logics
Editorial

• 
  Willem Conradie, Alessandra Palmigiano:
  Editorial. 607-608

Special issue articles

• 
  Wilmari Morton, Clint J. van Alten:
  The canonical FEP construction. 609-637
• 
  Sabine Frittella, Alessandra Palmigiano, Luigi Santocanale:
  Dual characterizations for finite lattices via correspondence theory for monotone modal logic. 639-678
• 
  Nick Bezhanishvili, Sumit Sourabh:
  Sahlqvist preservation for topological fixed-point logic. 679-703
• 
  Willem Conradie, Andrew Craig:
  Canonicity results for mu-calculi: an algorithmic approach. 705-748
• 
  Lutz Schröder, Dirk Pattinson, Tadeusz Litak:
  A Van Benthem/Rosen theorem for coalgebraic predicate logic. 749-773
• 
  Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao:
  Sahlqvist theory for impossible worlds. 775-816
• 
  Alessandra Palmigiano, Sumit Sourabh, Zhiguang Zhao:
  Jónsson-style canonicity for ALBA-inequalities. 817-865
• 
  Willem Conradie, Claudette Robinson:
  On Sahlqvist theory for hybrid logics. 867-900
• 
  Philippe Balbiani, Tinko Tinchev:
  Undecidable problems for modal definability. 901-920
• 
  Minghui Ma, Zhiguang Zhao:
  Unified correspondence and proof theory for strict implication. 921-960

Volume 27, Number 4, June 2017

Regular Articles

• 
  Andrew Matusiewicz, Neil V. Murray, Paul W. Olsen, Erik Rosenthal:
  Computing prime implicates by pruning the search space and accelerating subsumption. 961-983
• 
  Seyed Mohammad Bagheri, Roghieh Safari:
  Completeness for linear continuous logic. 985-998
• 
  Emanuel Kieronski, Ian Pratt-Hartmann, Lidia Tendera:
  Equivalence closure in the two-variable guarded fragment. 999-1021
• 
  Gabriela Steren, Eduardo Bonelli:
  The first-order hypothetical logic of proofs. 1023-1066
• 
  Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
  Implementing Courcelle's Theorem in a declarative framework for dynamic programming. 1067-1094
• 
  Shuanglong Kan, Zhiqiu Huang, Zhe Chen, Weiwei Li, Yutao Huang:
  Partial order reduction for checking LTL formulae with the next-time operator. 1095-1131

Technical Note

• 
  Sven Ove Hansson:
  AGM contraction is not reconstructible as a descriptor operation. 1133-1141

Corner Articles

• 
  Brett McLean:
  Complete representation by partial functions for composition, intersection and anti-domain. 1143-1156
• 
  Marija Boricic:
  Suppes-style sequent calculus for probability logic. 1157-1168
• 
  Christian W. Bach, Jérémie Cabessa:
  Limit-agreeing to disagree. 1169-1187
• 
  Pavel Naumov, Jia Tao:
  Knowledge in communication networks. 1189-1224
• 
  Cédric Dégremont, Soumya Paul, Nicholas Asher:
  A logic of sights. 1225-1305

Volume 27, Number 5, July 2017

Regular Articles

• 
  Libor Behounek:
  A minimalistic many-valued theory of types. 1307-1332
• 
  Juha Kontinen, Julian-Steffen Müller, Henning Schnoor, Heribert Vollmer:
  Modal independence logic. 1333-1352
• 
  Johan van Benthem, Nick Bezhanishvili, Wesley H. Holliday:
  A bimodal perspective on possibility semantics. 1353-1389
• 
  Saeed Salehi, Payam Seraji:
  Gödel-Rosser's Incompleteness Theorem, generalized and optimized for definable theories. 1391-1397
• 
  Evgeny Zolin:
  Undecidability of the transitive graded modal logic with converse. 1399-1420
• 
  Gabrielle Anderson, David J. Pym:
  A Substructural Modal Logic of Utility. 1421-1464

Corner Articles

• 
  Victor Lagerkvist, Magnus Wahlström:
  The power of primitive positive definitions with polynomially many variables. 1465-1488
• 
  Wolfgang Dvorák, Christof Spanring:
  Comparing the expressiveness of argumentation semantics. 1489-1521
• 
  Norihiro Kamide:
  Logics with definitional reflection rules. 1523-1548
• 
  Norihiro Kamide, Yaroslav Shramko:
  Embedding from multilattice logic into classical logic and vice versa. 1549-1575
• 
  Razvan Diaconescu:
  Implicit Kripke semantics and ultraproducts in stratified institutions. 1577-1606
• 
  Joaquín Díaz-Boïls:
  Categorical comprehensions and recursion. 1607-1641
• 
  Vít Puncochár:
  Algebras of Information States. 1643-1675

Volume 27, Number 6, September 2017

Special Issue: Universal Logic and Computation. Special issue to celebrate Jean-Yves Beziau's 50th birthday
Editorial

• 
  Razvan Diaconescu:
  Universal logic and computation. 1677-1678

Special Issue Articles

• 
  Ionut Tutu, José Luiz Fiadeiro:
  From conventional to institution-independent logic programming. 1679-1716
• 
  Daniel Gâinâ:
  Downward Löwenheim-Skolem Theorem and interpolation in logics with constructors. 1717-1752
• 
  Florian Rabe:
  How to identify, translate and combine logics? 1753-1798
• 
  Adriana Balan, Alexander Kurz, Jirí Velebil:
  An institutional approach to positive coalgebraic logic. 1799-1824
• 
  Diana Costa, Manuel A. Martins:
  Paraconsistency in hybrid logic. 1825-1852
• 
  Juan Carlos Agudelo Agudelo, Walter Carnielli:
  Polynomial ring calculus for modalities. 1853-1870

Volume 27, Number 7, October 2017

Regular Articles

• 
  Jerzy Pilecki, Marek A. Bednarczyk, Wojciech Jamroga:
  SMC: synthesis of uniform strategies and verification of strategic ability for multi-agent systems. 1871-1895
• 
  Alexander Leitsch, Nicolas Peltier, Daniel Weller:
  CERES for first-order schemata. 1897-1954
• 
  Ali Rezaei Divroodi, Linh Anh Nguyen:
  On directed simulations in description logics. 1955-1986
• 
  Argimiro Arratia, Carlos E. Ortiz:
  Methods of class field theory to separate logics over finite residue classes and circuit complexity. 1987-2009
• 
  Eduardo Fermé, Marco Garapa, Maurício D. Luís Reis:
  On ensconcement and contraction. 2011-2042
• 
  Natasha Alechina, Wiebe van der Hoek, Brian Logan:
  Fair decomposition of group obligations. 2043-2062

Corner Articles

• 
  Sérgio Marcelino, Carlos Caleiro:
  On the characterization of fibred logics, with applications to conservativity and finite-valuedness. 2063-2088
• 
  Mark Snaith, Chris Reed:
  Argument Revision. 2089-2134
• 
  Nick Bezhanishvili, Silvio Ghilardi, Frederik Möllerström Lauridsen:
  One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property. 2135-2169
• 
  Michael Brand, David L. Dowe:
  The IMP game: Learnability, approximability and adversarial learning beyond $$\Sigma^0_1$$. 2171-2192
• 
  Emmanuel Chemla, Paul Égré, Benjamin Spector:
  Characterizing logical consequence in many-valued logic. 2193-2226
• 
  Stefano Aguzzoli, Manuela Busaniche, Brunella Gerla, Miguel Andrés Marcos:
  On the category of Nelson paraconsistent lattices. 2227-2250
• 
  Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
  On the likelihood of normalization in combinatory logic. 2251-2269
• 
  Norihiro Kamide:
  Relating first-order monadic omega-logic, propositional linear-time temporal logic, propositional generalized definitional reflection logic and propositional infinitary logic. 2271-2301

Volume 27, Number 8, December 2017

Regular Articles

• 
  Costas D. Koutras, Christos Moyzes, Yorgos Zikos:
  A modal logic of knowledge, belief and estimation. 2303-2339
• 
  Fernando R. Velázquez-Quesada:
  Reliability-based preference dynamics: lexicographic upgrade. 2341-2381
• 
  Yanjun Li, Quan Yu, Yanjing Wang:
  More for free: a dynamic epistemic framework for conformant planning over transition systems. 2383-2410
• 
  Kentarô Yamamoto:
  Results in modal correspondence theory for possibility semantics. 2411-2430
• 
  Ringo Baumann, Hannes Strass:
  On the number of bipolar Boolean functions. 2431-2449
• 
  Juan Pablo Aguilera Ozuna, David Fernández-Duque:
  Verification logic. 2451-2469

Corner Articles

• 
  Livio Robaldo, Xin Sun:
  Reified Input/Output logic: Combining Input/Output logic and Reification to represent norms coming from existing legislation. 2471-2503
• 
  Patrick Allo:
  Hard and soft logical information. 2505-2524
• 
  Stefano Aguzzoli, Tommaso Flaminio, Sara Ugolini:
  Equivalences between subcategories of MTL-algebras via Boolean algebras and prelinear semihoops. 2525-2549
• 
  Ana Luísa Duboc, Aline Paes, Gerson Zaverucha:
  On the formal characterization of the FORTE_MBC theory revision operators. 2551-2580
• 
  Edmond Awad, Martin W. A. Caminada, Gabriella Pigozzi, Mikolaj Podlaszewski, Iyad Rahwan:
  Pareto optimality and strategy-proofness in group argument evaluation. 2581-2609
• 
  Maciej Bendkowski, Katarzyna Grygiel, Pierre Lescanne, Marek Zaionc:
  Combinatorics of $$\lambda$$-terms: a natural approach. 2611-2630
• 
  Martin Fischer, Carlo Nicolai, Leon Horsten:
  Iterated reflection over full disquotational truth. 2631-2651
• 
  Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pedro Sánchez Terraf:
  The lattice of congruences of a finite line frame. 2653-2688