default search action
Journal of Logic and Computation, Volume 26
Volume 26, Number 1, February 2016
- Ofer Arieli, Beata Konikowska, Alexander Rabinovich, Anna Zamansky:
Foreword. 1-6
- Régis Alenda, Nicola Olivetti, Gian Luca Pozzato:
Nested sequent calculi for normal conditional logics. 7-50 - Matthias Baaz, Agata Ciabattoni:
Proof theory of witnessed Gödel logic: A negative result. 51-64 - Diderik Batens:
Spoiled for choice? 65-95 - Walter Alexandre Carnielli, Marcelo E. Coniglio:
Paraconsistent set theory by predicating on consistency. 97-116 - Carlos Cotrini, Yuri Gurevich:
Basic primal infon logic. 117-141 - Nachum Dershowitz, Gilles Dowek:
Universality in two dimensions. 143-167 - Roy Dyckhoff, Sara Negri:
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. 169-187 - Christian G. Fermüller:
On matrices, Nmatrices and games. 189-211 - Melvin Fitting:
Realization using the model existence theorem. 213-234 - Nissim Francez:
Relevant harmony. 235-245 - Dov M. Gabbay:
Logical foundations for bipolar and tripolar argumentation networks: preliminary results. 247-292 - Furio Honsell, Marina Lenisa, Ivan Scagnetto, Luigi Liquori, Petar Maksimovic:
An open logical framework. 293-335 - Ori Lahav:
Semantic investigation of canonical Gödel hypersequent systems. 337-360 - Joke Meheus, Christian Straßer, Peter Verdée:
Which style of reasoning to choose in the face of conflicting information? 361-380 - George Metcalfe:
An Avron rule for fragments of R-mingle. 381-393 - Grigori Mints, Shane Steinert-Threlkeld:
ADC method of proof search for intuitionistic propositional natural deduction. 395-408 - Daniele Mundici:
Logic on the n-cube. 409-424 - Heinrich Wansing:
Falsification, natural deduction and bi-intuitionistic logic. 425-450 - Sergei N. Artëmov, Tatiana Yavorskaya:
Binding modalities. 451-461
Volume 26, Number 2, April 2016
- Didier Galmiche, Stéphane Graham-Lengrand:
Special Issue on Computational Logic in Honour of Roy Dyckhoff. 463-465
- Ursula Martin:
Computational logic and the social. 467-477 - Nissim Francez:
Views of proof-theoretic semantics: reified proof-theoretic meanings. 479-494 - Luca Tranchini:
Proof-theoretic semantics, paradoxes and the distinction between sense and denotation. 495-512 - Sara Negri:
Proof analysis beyond geometric theories: from rule systems to systems of rules. 513-537 - Vivek Nigam, Elaine Pimentel, Giselle Reis:
An extended framework for specifying and reasoning about proof systems. 539-576 - Kaustuv Chaudhuri, Stefan Hetzl, Dale Miller:
A multi-focused proof system isomorphic to expansion proofs. 577-603 - Dominique Larchey-Wendling:
The formal strong completeness of partial monoidal Boolean BI. 605-640 - Ewen Maclean, Andrew Ireland, Gudmund Grov:
Proof automation for functional correctness in separation logic. 641-675 - Luca Roversi:
A deep inference system with a self-dual binder which is complete for linear lambda calculus. 677-698 - James Cheney:
A simple sequent calculus for nominal logic. 699-726 - Toshihiko Uchida:
A partial translation from λU to λ2. 727-743 - Ekaterina Komendantskaya, John Power, Martin Schmidt:
Coalgebraic logic programming: from Semantics to Implementation. 745-783 - Mehrnoosh Sadrzadeh, Stephen Clark, Bob Coecke:
The Frobenius anatomy of word meanings II: possessive relative pronouns. 785-815
Volume 26, Number 3, June 2016
- Szymon Klarman, Víctor Gutiérrez-Basulto:
Description logics of context. 817-854 - Razvan Diaconescu:
Quasi-varieties and initial semantics for hybridized institutions. 855-891 - László Egri:
On constraint satisfaction problems below P. 893-922
- Libor Barto:
The collapse of the bounded width hierarchy. 923-943 - Vladimir V. Rybakov:
Non-transitive linear temporal logic and logical knowledge operations. 945-958 - Giorgio Magri:
Noise robustness and stochastic tolerance of OT error-driven ranking algorithms. 959-988 - Stéphane Demri, Morgan Deters:
Temporal logics on strings with prefix relation. 989-1017 - Alberto Gatto:
On the Priorean temporal logic with [d] over the real line. 1019-1041
- Zeki Bayram, Omid Sharifi:
Unifying F-logic molecules: a rectification to the original unification algorithm. 1043-1049
Volume 26, Number 4, August 2016
- Pietro Baroni, Dov M. Gabbay, Massimiliano Giacomin:
Introduction to the special issue on Loops in Argumentation. 1051-1053
- Trevor J. M. Bench-Capon:
Dilemmas and paradoxes: cycles in argumentation frameworks. 1055-1064 - Dov M. Gabbay:
The handling of loops in argumentation networks. 1065-1147 - Wolfgang Dvorák, Sarah Alice Gaggl:
Stage semantics and the SCC-recursive schema for argumentation semantics. 1149-1202 - Ofer Arieli:
On the acceptance of loops in argumentation frameworks. 1203-1234 - Gustavo Adrian Bodanza, Fernando A. Tohmé, Guillermo Ricardo Simari:
Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria. 1235-1255 - Martin W. A. Caminada, Wolfgang Dvorák, Srdjan Vesic:
Preferred semantics as socratic discussion. 1257-1292 - Ringo Baumann, Stefan Woltran:
The role of self-attacking arguments in characterizations of equivalence notions. 1293-1313 - Teresa Alsinet, Ramón Béjar, Lluís Godo, Francesc Guitart:
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics. 1315-1360
Volume 26, Number 5, October 2016
- Juan Carlos Nieves, Mauricio Osorio:
Ideal extensions as logical programming models. 1361-1393 - Josep Maria Font:
Ordering protoalgebraic logics. 1395-1419 - Pavel Naumov, Margaret Protzman:
Conditional interchangeability of Nash equilibria. 1421-1438 - Tim French, John Christopher McCabe-Dansted, Mark Reynolds:
A complete axiomatization of a temporal logic with obligation and robustness. 1439-1467 - Makoto Kanazawa:
Multidimensional trees and a Chomsky-Schützenberger-Weir representation theorem for simple context-free tree grammars. 1469-1516 - Christian Straßer, Frederik Van De Putte:
Adaptive strategies and finite-conditional premise sets. 1517-1539 - Sebastian Enqvist:
A new coalgebraic Lindström theorem. 1541-1566 - Bartosz Wieckowski:
Refinements of subatomic natural deduction. 1567-1616 - Thomas Macaulay Ferguson:
Faulty Belnap computers and subsystems of FDE. 1617-1636 - Pavel Naumov, Margaret Protzman:
Equilibria interchangeability in cellular games. 1637-1661 - Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
Relentful strategic reasoning in alternating-time temporal logic. 1663-1695 - Maciej Swiechowski, Jacek Mandziuk:
Fast interpreter for logical reasoning in general game playing. 1697-1727 - Stanislav O. Speranski:
A note on hereditarily Π10- and Σ10-complete sets of sentences. 1729-1741 - Seyed Amin Khatami, Massoud Pourmahdian, Nazanin Roshandel Tavana:
From rational Gödel logic to ultrametric logic. 1743-1767 - Steffen Lewitzka:
Algebraic semantics for a modal logic close to S1. 1769-1783
Volume 26, Number 6, December 2016
- Olivier Roy, Ole Thomassen Hjortland:
Special issue on substructural logic and information dynamics: introduction. 1785-1786
- Igor Sedlár:
Epistemic extensions of modal distributive substructural logics. 1787-1813 - Marta Bílková, Ondrej Majer, Michal Pelis:
Epistemic logics for sceptical agents. 1815-1841 - Olivier Roy, Ole Thomassen Hjortland:
Dynamic consequence for soft information. 1843-1864 - Guillaume Aucher:
Displaying updates in logic. 1865-1912 - Guillaume Aucher:
Dynamic epistemic logic in update logic. 1913-1960 - Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimic:
A proof-theoretic semantic analysis of dynamic epistemic logic. 1961-2015 - Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimic:
Multi-type display calculus for dynamic epistemic logic. 2017-2065 - Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano:
Multi-type display calculus for propositional dynamic logic. 2067-2104
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.