Journal: Journal of Logic and Computation

Volume 30, Issue 8

1429 -- 0Sergei N. Artëmov, Anil Nerode. Editorial
1431 -- 1446Sergei N. Artëmov. Justification awareness
1447 -- 1468Matthias Baaz, Alexander Leitsch, Anela Lolic. An abstract form of the first epsilon theorem
1469 -- 1485Kai Brünnler, Dandolo Flumini, Thomas Studer. A logic of blockchain updates
1487 -- 1504Hannes Diener, Robert S. Lubarsky. Notions of Cauchyness and metastability
1505 -- 1540Thomas Macaulay Ferguson. Explicit analyses of proof/refutation interaction for constructible falsity and Heyting-Brouwer logic
1541 -- 1566Miika Hannula, Juha Kontinen, Jonni Virtema. Polyteam semantics
1567 -- 1608Simona Kasterovic, Silvia Ghilezan. Kripke-style Semantics and Completeness for Full Simply Typed Lambda Calculus
1609 -- 1668Yanhong A. Liu, Scott D. Stoller. Founded semantics and constraint semantics of logic rules
1639 -- 1679Dag Normann, Sam Sanders. Open sets in computability theory and reverse mathematics
1681 -- 1693Fedor Pakhomov, Alexander Zapryagaev. Multi-dimensional Interpretations of Presburger Arithmetic in Itself
1695 -- 1709V. Alexis Peluce. Epistemic predicates in the arithmetical context
1711 -- 1742Benjamin Ralph. Herbrand Proofs and Expansion Proofs as Decomposed Proofs

Volume 30, Issue 7

1305 -- 1329Mikhail N. Rybakov, Dmitry Shkatov. Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
1331 -- 1355Nick Bezhanishvili, Tim Henke. A model-theoretic approach to descriptive general frames: the van Benthem characterization theorem
1357 -- 1376Theofanis I. Aravanis. On uniform belief revision
1377 -- 1399Daniel Gaina, Tomasz Kowalski. Fraïssé-Hintikka theorem in institutions
1401 -- 1423Ivan Chajda, Helmut Länger. Sublattices and Δ-blocks of orthomodular posets
1425 -- 1428Viktor Chernov. Locally constant constructive functions and connectedness of intervals

Volume 30, Issue 6

1143 -- 1181Michael Freund. Ordered models for concept representation
1183 -- 1211Valentin Goranko, Antti Kuusisto, Raine Rönnholm. Rational coordination with no communication or conventions
1213 -- 1238Dominik Klein 0004, Rasmus K. Rendsvig. Convergence, continuity, recurrence and Turing completeness in dynamic epistemic logic1
1239 -- 1255Merlin Carl. Space and time complexity for infinite time Turing machines
1257 -- 1290Marcelo E. Coniglio, Aldo Figallo Orellano, Ana Claudia Golzio. First-order swap structures semantics for some logics of formal inconsistency
1291 -- 1302Satoru Niki, Peter Schuster 0001. On Scott's semantics for many-valued logic
1303 -- 0Guillaume Aucher. Corrigendum to: Displaying updates in logic

Volume 30, Issue 5

991 -- 1022Ivan Chajda, Davide Fazio, Antonio Ledda. The generalized orthomodularity property: configurations and pastings
1023 -- 1062Nicolas Troquard. Individual resource games and resource redistributions
1063 -- 1107Wolfgang Dvorák, Anna Rapberger, Stefan Woltran. On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs
1109 -- 1124Janusz Ciuciura. Sette's calculus P1 and some hierarchies of paraconsistent systems
1125 -- 1142Theofanis I. Aravanis, Pavlos Peppas, Mary-Anne Williams. A study of possible-worlds semantics of relevance-sensitive belief revision

Volume 30, Issue 4

835 -- 836Daniela Inclezan, Marco Maratea. Seventh ASPOCP International Workshop on 'Answer Set Programming and Other Computing Paradigms'
837 -- 862Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran. Computing secure sets in graphs using answer set programming
863 -- 897Mario Alviano, Carmine Dodaro, João Marques-Silva 0001, Francesco Ricca. Optimum stable model search: algorithms and implementation
899 -- 922Joseph Babb, Joohyung Lee. Action language ℬℭ+
923 -- 952Martin Gebser, Tomi Janhunen, Jussi Rintanen. Declarative encodings of acyclicity properties
953 -- 989Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, Yuanlin Zhang 0002. The language of epistemic specifications (refined) including a prototype solver

Volume 30, Issue 3

697 -- 714Stefan Hetzl, Sebastian Zivota. Decidability of affine solution problems
715 -- 743Dazhu Li. Losing connection: the modal logic of definable link deletion
745 -- 763Ming Hsiung. Elementary cellular automata and self-referential paradoxes
765 -- 783Uri Andrews, Noah Schweber, Andrea Sorbi. Self-full ceers and the uniform join operator
785 -- 833Rob Egrot. Order polarities

Volume 30, Issue 2

525 -- 548Murdoch Gabbay. Equivariant ZFA and the foundations of nominal techniques
549 -- 560Mikhail N. Rybakov, Dmitry Shkatov. Recursive enumerability and elementary frame definability in predicate modal logic
561 -- 633Juan Climent Vidal, Enric Cosme-Llópez. Congruence-based proofs of the recognizability theorems for free many-sorted algebras
635 -- 661Edilson Rodrigues, Paulo E. Santos, Marcos Lopes, Brandon Bennett, Paul E. Oppenheimer. Standpoint semantics for polysemy in spatial prepositions
663 -- 696Ian Shillito. A multi-labelled sequent calculus for Topo-Logic

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