Journal of Logic and Computation

Papers
(The TQCC of Journal of Logic and Computation is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-04-01 to 2024-04-01.)
ArticleCitations
Open sets in computability theory and reverse mathematics15
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages14
Declarative continuous reasoning in the cloud-IoT continuum13
The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis12
Algorithmic properties of first-order superintuitionistic logics of finite Kripke frames in restricted languages11
Completeness theorems for first-order logic analysed in constructive type theory10
Complexity of finite-variable fragments of products with K10
Founded semantics and constraint semantics of logic rules9
Labelled calculi for quantified modal logics with definite descriptions8
Losing connection: the modal logic of definable link deletion8
Abstract argumentation and the rational man8
An efficient reasoning method on logic programming using partial evaluation in vector spaces8
Algorithmic properties of first-order modal logics of linear Kripke frames in restricted languages8
Monadic NM-algebras: an algebraic approach to monadic predicate nilpotent minimum logic8
A conditional, a fuzzy and a probabilistic interpretation of self-organizing maps7
Handling inconsistency in partially preordered ontologies: the Elect method7
Complexity of finite-variable fragments of products with non-transitive modal logics6
A logic of blockchain updates6
Ordered models for concept representation6
Arg2P: an argumentation framework for explainable intelligent systems6
Neighbourhood semantics and labelled calculus for intuitionistic infinitary logic6
Fibrational bisimulations and quantitative reasoning: Extended version5
Modal Logics and Group Polarization5
Relating structure and power: Comonadic semantics for computational resources5
A Labelling Semantics and Strong Admissibility for Weighted Argumentation Frameworks5
Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity5
On uniform belief revision5
Modular non-deterministic semantics for T, TB, S4, S5 and more4
Notes on conjunctive and Quasi degrees4
Logics of formal inconsistency based on distributive involutive residuated lattices4
On the computational properties of basic mathematical notions4
Truth tables for modal logics T and S4, by using three-valued non-deterministic level semantics4
Negation as a modality in a quantified setting4
Categorical and algebraic aspects of the intuitionistic modal logic IEL― and its predicate extensions4
Epistemic extensions of substructural inquisitive logics4
Weak relevant justification logics4
A study of possible-worlds semantics of relevance-sensitive belief revision4
Observing interventions: a logic for thinking about experiments4
Space and time complexity for infinite time Turing machines4
Markov chain model representation of information diffusion in social networks4
A unified logical framework for explanations in classifier systems3
Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics3
Change in social networks: Some dynamic extensions of Social Epistemic Logic3
First-order swap structures semantics for some logics of formal inconsistency3
The polyhedral geometry of Wajsberg hoops3
Rational coordination with no communication or conventions3
Densely computable structures3
A Principle-based Account of Self-attacking Arguments in Gradual Semantics3
Satisfiability of constrained Horn clauses on algebraic data types: A transformation-based approach3
Self-full ceers and the uniform join operator3
Consistency and permission in deontic justification logic3
Multi-dimensional Interpretations of Presburger Arithmetic in Itself3
Kripke-style Semantics and Completeness for Full Simply Typed Lambda Calculus3
Knowledge of uncertain worlds: programming with logical constraints3
Semantic data management in P2P systems driven by self-esteem3
Reasoning about epistemic social network dynamics using dynamic term-modal logic3
Modelling Ceteris Paribus Preferences with Deontic Logic3
Convergence, continuity, recurrence and Turing completeness in dynamic epistemic logic13
Dualities and algebraic geometry of Baire functions in non-classical logic3
On the correspondence between nested calculi and semantic systems for intuitionistic logics3
EGG+: A graph grammar formalism with uncertain structure processing mechanism2
Containment logics: Algebraic Counterparts and Reduced Models2
A parameterized view on the complexity of dependence and independence logic2
Calculi, countermodel generation and theorem prover for strong logics of counterfactual reasoning2
An ASP-based solver for parametrized-difference revision2
Hybrid sabotage modal logic2
Decompositions of stratified institutions2
On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs2
Modular orders on defaults in formal argumentation2
Commutative action logic2
A logic-based tractable approximation of probability2
A computationally grounded logic of awareness2
Explicit analyses of proof/refutation interaction for constructible falsity and Heyting–Brouwer logic2
Group belief2
Reasoning about strategic voting in modal logic quickly becomes undecidable2
Cut-free sequent-style systems for a logic associated to involutive Stone algebras2
Complexity function and complexity of validity of modal and superintuitionistic propositional logics2
Feedback hyperjump2
There are no minimal essentially undecidable theories2
Logics for reasoning about degrees of confirmation2
Extensional realizability for intuitionistic set theory2
Intuitionistic multi-agent subatomic natural deduction for belief and knowledge2
Guaranteeing Admissibility of Abstract Argumentation Frameworks with Rationality and Feasibility Constraints2
Dialectica logical principles: not only rules2
Projective classes as images of accessible functors2
Modelling efficient team structures in biology2
The first-order theory of the computably enumerable equivalence relations in the uncountable setting2
Countably many sublogics of the interpretability logicILhaving fixed point properties2
The generalized orthomodularity property: configurations and pastings2
Qualitative uncertainty and dynamics of argumentation through dynamic logic2
Computability of glued manifolds2
Decomposition approaches for scheduling chronic outpatients’ clinical pathways in Answer Set Programming2
On the Turing complexity of learning finite families of algebraic structures2
0.025352001190186