default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 31
Volume 31, Number 1, January 2021
- Sergei N. Artëmov, Anil Nerode:
Editorial. 1 - Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
On computable aspects of algebraic and definable closure. 2-19 - Juan P. Aguilera
, Robert S. Lubarsky:
Feedback hyperjump. 20-39 - Matthias Baaz, Anela Lolic:
Towards a proof theory for Henkin quantifiers. 40-66 - Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel:
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity. 67-111 - Yannick Forster, Dominik Kirst, Dominik Wehr:
Completeness theorems for first-order logic analysed in constructive type theory. 112-151 - Vladimir N. Krupski:
On sharp and single-conclusion justification models. 152-167 - Hirohiko Kushida:
Constructive truth and falsity in Peano arithmetic. 168-178 - Daniel Leivant:
Finitism, imperative programs and primitive recursion. 179-192 - Yanhong A. Liu, Scott D. Stoller:
Knowledge of uncertain worlds: programming with logical constraints. 193-212 - Tim S. Lyon:
On the correspondence between nested calculi and semantic systems for intuitionistic logics. 213-265 - Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized complexity of abduction in Schaefer's framework. 266-296 - Dag Normann, Sam Sanders:
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis. 297-325 - Diogo Poças, Jeffery I. Zucker:
Tracking computability of GPAC-generable functions. 326-346 - Daniel Rogozin:
Categorical and algebraic aspects of the intuitionistic modal logic IEL - and its predicate extensions. 347-374 - Dan E. Willard:
About the characterization of a fine line that separates generalizations and boundary-case exceptions for the Second Incompleteness Theorem under semantic tableau deduction. 375-392
Volume 31, Number 2, March 2021
- Massoud Pourmahdian, R. Zoghifard:
Probability logic: A model-theoretic perspective. 393-415 - M. Clarence Protin:
Type inhabitation of atomic polymorphism is undecidable. 416-425 - Mikhail N. Rybakov, Dmitry Shkatov:
Complexity of finite-variable fragments of products with K. 426-443 - Lázaro Alberto Larrauri:
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas. 444-472 - Steffen Lewitzka:
Access-based intuitionistic knowledge. 473-493 - Mikhail N. Rybakov, Dmitry Shkatov:
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages. 494-522 - Zhiguang Zhao:
Algorithmic correspondence and canonicity for possibility semantics. 523-572 - Julia Ilin, Dick de Jongh, Fan Yang:
NNIL-formulas revisited: Universal models and finite model property. 573-596 - Cornelis A. Middelburg:
On the strongest three-valued paraconsistent logic contained in classical logic and its dual. 597-611 - Isaac Goldbring, Bradd Hart:
Operator algebras with hyperarithmetic theory. 612-629 - Emanuele Frittaion, Michael Rathjen:
Extensional realizability for intuitionistic set theory. 630-653 - Timotheus Kampik, Juan Carlos Nieves:
Abstract argumentation and the rational man. 654-699
Volume 31, Number 3, April 2021
- Preface. 701-703
- Bartosz Wieckowski:
Intuitionistic multi-agent subatomic natural deduction for belief and knowledge. 704-770 - Camillo Fiorentini, Mauro Ferrari:
A forward internal calculus for model generation in S4. 771-796 - Roman Kuznets, Björn Lellmann:
Interpolation for intermediate logics via injective nested sequents. 797-831 - Stéphane Demri, Raul Fervari, Alessio Mansutti:
Internal proof calculi for modal logics with separating conjunction. 832-891 - Didier Galmiche, Daniel Méry:
Labelled cyclic proofs for separation logic. 892-922 - Eugenio Orlandelli:
Labelled calculi for quantified modal logics with definite descriptions. 923-946 - Marianna Girlando, Sara Negri, Nicola Olivetti:
Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics. 947-997 - Sonia Marin, Marianela Morales, Lutz Straßburger:
A fully labelled proof system for intuitionistic modal logics. 998-1022
Volume 31, Number 4, June 2021
- Fenrong Liu, Beishui Liao:
Reasoning in social settings. 1023-1025 - Stef Frijters, Frederik Van De Putte:
Classical term-modal logics. 1026-1054 - Erik Parmann, Thomas Ågotnes:
Reasoning about strategic voting in modal logic quickly becomes undecidable. 1055-1078 - Chenwei Shi:
No false grounds and topology of argumentation. 1079-1101 - Fengkui Ju, Karl Nygren, Tianwen Xu:
Modeling legal conflict resolution based on dynamic logic. 1102-1128 - Umberto Grandi, Emiliano Lorini, Arianna Novaro, Laurent Perrussel:
Games of influence. 1129-1157 - Huimin Dong:
Logic of defeasible permission and its dynamics. 1158-1193
Volume 31, Number 5, July 2021
- Tim Lethen:
A Talmudic norms approach to many-valued logic. 1195-1205 - Azza Gaysin:
ℋ-Colouring Dichotomy in Proof Complexity. 1206-1225 - Francesc Esteva, Aldo Figallo Orellano, Tommaso Flaminio, Lluís Godo:
Logics of formal inconsistency based on distributive involutive residuated lattices. 1226-1265 - Mikhail N. Rybakov, Dmitry Shkatov:
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages. 1266-1288 - Tejas Bhojraj:
Notions of indifference for genericity: Union sets and subsequence sets. 1289-1297 - Hien D. Nguyen, Chiaki Sakama, Taisuke Sato, Katsumi Inoue:
An efficient reasoning method on logic programming using partial evaluation in vector spaces. 1298-1316 - Irakli O. Chitaia, Roland Sh. Omanadze, Andrea Sorbi:
Notes on conjunctive and Quasi degrees. 1317-1329 - Stanislav O. Speranski:
Negation as a modality in a quantified setting. 1330-1355 - Sihem Belabbes, Salem Benferhat, Jan Chomicki:
Handling inconsistency in partially preordered ontologies: the Elect method. 1356-1388
Volume 31, Number 6, September 2021
- Preface. 1389
- Samson Abramsky, Nihil Shah:
Relating structure and power: Comonadic semantics for computational resources. 1390-1428 - Jirí Adámek, Stefan Milius, Henning Urbat:
On the behaviour of coalgebras with side effects and algebras with effectful iteration. 1429-1481 - Jurriaan Rot, Bart Jacobs, Paul Blain Levy:
Steps and traces. 1482-1525 - David Sprunger, Shin-ya Katsumata, Jérémy Dubut, Ichiro Hasuo:
Fibrational bisimulations and quantitative reasoning: Extended version. 1526-1559
Volume 31, Number 7, October 2021
- James E. Hanson:
Analog reducibility. 1561-1597 - Maciej Bendkowski:
A note on the asymptotic expressiveness of ZF and ZFC. 1598-1607 - Matteo Tesi, Sara Negri:
Neighbourhood semantics and labelled calculus for intuitionistic infinitary logic. 1608-1639 - Somayeh Chopoghloo, Morteza Moniri:
A strongly complete axiomatization of intuitionistic temporal logic. 1640-1659 - Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang:
A recursion theoretic foundation of computation over real numbers. 1660-1689 - Erich Grädel, Phil Pützstück:
Logics of dependence and independence: The local variants. 1690-1715 - Sohei Iwata, Taishi Kurahashi:
Topological semantics of conservativity and interpretability logics. 1716-1739 - Massimiliano Carrara, Wei Zhu:
Computational Errors and Suspension in a PWK Epistemic Agent. 1740-1757 - Glenn Blanchette, Anthony V. Robins, Willem Labuschagne:
Modelling supra-classical logic in a Boltzmann neural network: I representation. 1758-1799 - Yufeng Liu, Fan Yang:
EGG+: A graph grammar formalism with uncertain structure processing mechanism. 1800-1819 - Vít Puncochár, Igor Sedlár:
Epistemic extensions of substructural inquisitive logics. 1820-1844 - Pavel Naumov, Kevin Ros:
Strategic coalitions in stochastic games. 1845-1867 - Antonio Di Nola, Serafina Lapenta, Giacomo Lenzi:
Dualities and algebraic geometry of Baire functions in non-classical logic. 1868-1890 - Nikolay Bazhenov, Luca San Mauro:
On the Turing complexity of learning finite families of algebraic structures. 1891-1900
Volume 31, Number 8, December 2021
- Huimin Dong, Jun Pang, Yì N. Wáng:
Preface of the special issue'Logic, argumentation and AI' in JLC. 1901-1902 - Jan Gorzny, Ezequiel Postan, Bruno Woltzenlogel Paleo:
Lifting propositional proof compression algorithms to first-order logic. 1903-1932 - Takahiro Sawasaki, Katsuhiko Sano:
Frame definability, canonicity and cut elimination in common sense modal predicate logics. 1933-1958 - Thomas Ågotnes, Yì N. Wáng:
Group belief. 1959-1978 - Liping Tang:
Ambiguity and context learning in signalling games. 1979-2003 - Yì N. Wáng, Xu Li:
A logic of knowledge based on abstract arguments. 2004-2027 - Nicos Isaak, Loizos Michael:
Experience and prediction: a metric of hardness for a novel litmus test. 2028-2056 - Stanislaw J. Purgal, Julian Parsert, Cezary Kaliszyk:
A study of continuous vector representations for theorem proving. 2057-2083 - Michael Baur, Thomas Studer:
Semirings of Evidence. 2084-2106 - Ming Hsiung:
Solovay functions and paradoxes. 2107-2132 - Weiwei Chen:
Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints. 2133-2158 - Ivo Düntsch, Wojciech Dzik:
Ideal related algebras and their logics. 2159-2188 - Sejla Dautovic, Dragan Doder, Zoran Ognjanovic:
Logics for reasoning about degrees of confirmation. 2189-2217 - Marcos Cramer:
Paracomplete truth theory with KFS-definable determinateness. 2218-2239 - Mina Young Pedersen, Sonja Smets, Thomas Ågotnes:
Modal Logics and Group Polarization. 2240-2269
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-12 23:10 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:
