default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 30
Volume 30, Number 1, January 2020
- Sergei N. Artëmov, Anil Nerode:
Special Issue on Logical Foundations of Computer Science. 1 - Antonis Achilleos
:
Modal logics with hard diamond-free fragments. 3-25 - Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky:
An introduction to feedback Turing computability. 27-60 - Sergei N. Artëmov:
On aggregating probabilistic evidence. 61-76 - Marco Devesas Campos, Marcelo Fiore:
Classical logic with Mendler induction. 77-106 - Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel:
On the complexity of index sets for finite predicate logic programs which allow function symbols. 107-156 - Harley Eades III, Valeria de Paiva:
Multiple conclusion linear logic: cut elimination and more. 157-174 - Nathanaël Fijalkow:
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. 175-192 - Melvin Fitting, Felipe de Souza Salvatore:
First-order justification logic with constant domain semantics. 193-216 - Henrik Forssell, Håkon Robbestad Gylterud, David I. Spivak:
Type theoretical databases. 217-238 - Max I. Kanovich, Stepan L. Kuznetsov, Andre Scedrov:
Reconciling Lambek's restriction, cut-elimination and substitution in the presence of exponential modalities. 239-256 - Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer:
Probabilistic justification logic. 257-280 - Vladimir N. Krupski:
Cut elimination and complexity bounds for intuitionistic epistemic logic. 281-294 - Hidenori Kurokawa, Hirohiko Kushida:
Resource sharing linear logic. 295-319 - Shoshin Nomura, Hiroakira Ono, Katsuhiko Sano:
A cut-free labelled sequent calculus for dynamic epistemic logic. 321-348 - Iosif Petrakis:
Embeddings of Bishop spaces. 349-379 - Tudor Protopopescu:
An arithmetic interpretation of intuitionistic verification. 381-402 - R. Ramanujam, Ramanathan S. Thinniyam:
Definability in first-order theories of graph orderings ⋆. 403-420 - R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh:
The complexity of disjunction in intuitionistic logic. 421-445 - Michael Rathjen:
Power Kripke-Platek set theory and the axiom of choice. 447-457 - Sam Sanders:
The unreasonable effectiveness of Nonstandard Analysis. 459-524
Volume 30, Number 2, March 2020
- Murdoch Gabbay:
Equivariant ZFA and the foundations of nominal techniques. 525-548 - Mikhail N. Rybakov, Dmitry Shkatov:
Recursive enumerability and elementary frame definability in predicate modal logic. 549-560 - Juan Climent Vidal, Enric Cosme-Llópez:
Congruence-based proofs of the recognizability theorems for free many-sorted algebras. 561-633 - Edilson Rodrigues, Paulo E. Santos, Marcos Lopes, Brandon Bennett, Paul E. Oppenheimer:
Standpoint semantics for polysemy in spatial prepositions. 635-661 - Ian Shillito:
A multi-labelled sequent calculus for Topo-Logic. 663-696
Volume 30, Number 3, April 2020
- Stefan Hetzl, Sebastian Zivota:
Decidability of affine solution problems. 697-714 - Dazhu Li:
Losing connection: the modal logic of definable link deletion. 715-743 - Ming Hsiung:
Elementary cellular automata and self-referential paradoxes. 745-763 - Uri Andrews, Noah Schweber, Andrea Sorbi:
Self-full ceers and the uniform join operator. 765-783 - Rob Egrot:
Order polarities. 785-833
Volume 30, Number 4, June 2020
- Daniela Inclezan, Marco Maratea:
Seventh ASPOCP International Workshop on 'Answer Set Programming and Other Computing Paradigms'. 835-836 - Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran:
Computing secure sets in graphs using answer set programming. 837-862 - Mario Alviano, Carmine Dodaro, João Marques-Silva, Francesco Ricca:
Optimum stable model search: algorithms and implementation. 863-897 - Joseph Babb, Joohyung Lee:
Action language ℬℭ+. 899-922 - Martin Gebser, Tomi Janhunen, Jussi Rintanen:
Declarative encodings of acyclicity properties. 923-952 - Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, Yuanlin Zhang:
The language of epistemic specifications (refined) including a prototype solver. 953-989
Volume 30, Number 5, July 2020
- Ivan Chajda, Davide Fazio, Antonio Ledda:
The generalized orthomodularity property: configurations and pastings. 991-1022 - Nicolas Troquard:
Individual resource games and resource redistributions. 1023-1062 - Wolfgang Dvorák, Anna Rapberger, Stefan Woltran:
On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. 1063-1107 - Janusz Ciuciura:
Sette's calculus P1 and some hierarchies of paraconsistent systems. 1109-1124 - Theofanis I. Aravanis, Pavlos Peppas, Mary-Anne Williams:
A study of possible-worlds semantics of relevance-sensitive belief revision. 1125-1142
Volume 30, Number 6, September 2020
- Michael Freund:
Ordered models for concept representation. 1143-1181 - Valentin Goranko, Antti Kuusisto, Raine Rönnholm:
Rational coordination with no communication or conventions. 1183-1211 - Dominik Klein, Rasmus K. Rendsvig:
Convergence, continuity, recurrence and Turing completeness in dynamic epistemic logic1. 1213-1238 - Merlin Carl:
Space and time complexity for infinite time Turing machines. 1239-1255 - Marcelo E. Coniglio, Aldo Figallo Orellano, Ana Claudia Golzio:
First-order swap structures semantics for some logics of formal inconsistency. 1257-1290 - Satoru Niki, Peter Schuster:
On Scott's semantics for many-valued logic. 1291-1302 - Guillaume Aucher:
Corrigendum to: Displaying updates in logic. 1303
Volume 30, Number 7, October 2020
- Mikhail N. Rybakov, Dmitry Shkatov:
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages. 1305-1329 - Nick Bezhanishvili, Tim Henke:
A model-theoretic approach to descriptive general frames: the van Benthem characterization theorem. 1331-1355 - Theofanis I. Aravanis:
On uniform belief revision. 1357-1376 - Daniel Gaina, Tomasz Kowalski:
Fraïssé-Hintikka theorem in institutions. 1377-1399 - Ivan Chajda, Helmut Länger:
Sublattices and Δ-blocks of orthomodular posets. 1401-1423 - Viktor Chernov:
Locally constant constructive functions and connectedness of intervals. 1425-1428
Volume 30, Number 8, December 2020
- Kai Brünnler, Dandolo Flumini, Thomas Studer:
A logic of blockchain updates. 1469-1485 - Dag Normann, Sam Sanders:
Open sets in computability theory and reverse mathematics. 1639-1679 - Benjamin Ralph:
Herbrand Proofs and Expansion Proofs as Decomposed Proofs. 1711-1742 - Hannes Diener, Robert S. Lubarsky:
Notions of Cauchyness and metastability. 1487-1504 - Yanhong A. Liu, Scott D. Stoller:
Founded semantics and constraint semantics of logic rules. 1609-1668 - Miika Hannula, Juha Kontinen, Jonni Virtema:
Polyteam semantics. 1541-1566 - Matthias Baaz, Alexander Leitsch, Anela Lolic:
An abstract form of the first epsilon theorem. 1447-1468 - Sergei N. Artëmov:
Justification awareness. 1431-1446 - Simona Kasterovic, Silvia Ghilezan:
Kripke-style Semantics and Completeness for Full Simply Typed Lambda Calculus. 1567-1608 - Fedor Pakhomov, Alexander Zapryagaev:
Multi-dimensional Interpretations of Presburger Arithmetic in Itself. 1681-1693 - V. Alexis Peluce:
Epistemic predicates in the arithmetical context. 1695-1709 - Thomas Macaulay Ferguson:
Explicit analyses of proof/refutation interaction for constructible falsity and Heyting-Brouwer logic. 1505-1540 - Sergei N. Artëmov, Anil Nerode:
Editorial. 1429
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.
last updated on 2025-12-09 23:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
