Notre Dame Journal of Formal Logic

Papers
(The median citation count of Notre Dame Journal of Formal Logic is 0. 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 2021-12-01 to 2025-12-01.)
ArticleCitations
Simple Tableaus for Simple Logics6
Shrieking, Shrugging, and the Australian Plan5
Asymptotic Classes of Trees and ℵ0-categoricity5
Logics of False Belief and Reliable Belief4
The Proof-Theoretic Strength of Constructive Second-Order Set Theories4
A Walk with Goodstein and Ackermann3
Burden of Henselian Valued Fields in the Denef–Pas Language3
Dominating Orders, Vertex Pursuit Games, and Computability Theory3
Exponential Fields: Lack of Generic Derivations3
Left Variable Inclusion Logics Associated with Classical Logic3
A Completeness Proof for a Regular Predicate Logic with Undefined Truth Value3
Tableaux and Interpolation for Propositional Justification Logics2
Provable Better-Quasi-Orders2
Geometric Modal Logic2
The Complexity of Decomposability of Computable Rings2
On Cns(κ) and the Juhász–Kunen Question2
Structural Completeness in Many-Valued Logics with Rational Constants2
Measuring Inconsistency in Some Logics with Tense Operators2
Completeness of Infinitary Heterogeneous Logic2
Sets Completely Separated by Functions in Bishop Set Theory2
A Problem for Relative-Sameness Semantics2
Core Tarski and Core McGee1
Products of Classes of Finite Structures1
Did Aristotle Endorse Aristotle’s Thesis? A Case Study in Aristotle’s Metalogic1
Unitary Representations of Locally Compact Groups as Metric Structures1
Effectively Constructible Fixed Points in Sacchetti’s Modal Logics of Provability1
Computable Categoricity Relative to a C.E. Degree1
Terence Tao, Hilbert’s Fifth Problem and Related Topics. American Mathematical Society, Providence, 2014. 338 pp.1
The Diversity of Minimal Cofinal Extensions1
Core Gödel1
Definability of Boolean Functions in Kripke Semantics1
Some Results on Non-Club Isomorphic Aronszajn Trees1
Modal Model Theory1
Classifying Invariants for E1: A Tail of a Generic Real1
Witt Vectors and Separably Closed Fields with Higher Derivations1
Thin Set Versions of Hindman’s Theorem0
Poly-Connexivity: Connexive Conjunction and Disjunction0
Model-Theoretic Properties of Dynamics on the Cantor Set0
Stabilizers, Measures, and IP Sets0
C. I. Lewis’s Intensional Semantics0
Generically Extendible Cardinals0
Stratified Formulas Are Not Context-Free0
Vaught’s Conjecture for Theories of Discretely Ordered Structures0
Substitutional Validity for Modal Logic0
Hierarchical Multiverse of Sets0
Class Theory in HYPE0
Dialetheias and Numbers Distinct from Themselves0
Logics of True Belief0
Typicality à la Russell in Set Theory0
Grothendieck Ring of the Pairing Function without Cycles0
State-Based Modal Logics for Free Choice0
Decision Times of Infinite Computations0
How to Take Cats Together0
An Invitation to Extension Domination0
Broad Infinity and Generation Principles0
Boolean-Valued Models of Set Theory with Urelements0
Monotone Subintuitionistic Logic: Duality and Transfer Results0
Topologizing Interpretable Groups in p-Adically Closed Fields0
In Memoriam: Yoram Hirshfeld0
There Are No Minimal Effectively Inseparable Theories0
On Stable Quotients0
Bicontextualism0
Topic-Theoretic Extensions of Analytic Implication0
Effect of the Choice of Connectives on the Relation between Classical Logic and Intuitionistic Logic0
Weak Kleene and Other Weak Logics of Conditionals0
Orthogonal Definable Subspaces of Hilbert Spaces: An Application of Goldblatt’s Method0
Deduction Theorem in Congruential Modal Logics0
Outline of an Intensional Theory of Truth0
Unified Natural Deduction for Logics of Strong Negation0
Planar Graphs with Separation Are dp-Minimal0
Wittgensteinian Predicate Logic and Compositionality0
A Family of dp-Minimal Expansions of (Z;+)0
Stage Comparison, Fixed Points, and Least Fixed Points in Kripke–Platek Environments0
Full Satisfaction Classes, Definability, and Automorphisms0
Complexity of Codes for Ramsey Positive Sets0
Iterating Both and Neither: With Applications to the Paradoxes0
Definable Version of Wedderburn–Artin Theorem in O-Minimal Structures0
One Lie Group to Define Them All0
Games on Base Matrices0
Representations and the Foundations of Mathematics0
Identity and the Cognitive Value of Logical Equations in Frege’s Foundational Project0
Lindström’s Characterizability of Abstract Logic Systems for Analytic Structures Based on Measures0
In Memoriam: Zoé Chatzidakis0
Rough Approximate Subgroups0
Lower Bounds of Sets of P-points0
A Local Version of the Slaman–Wehner Theorem and Families Closed Under Finite Differences0
A Temporal Epistemic Deontic Logic0
A Note on Torsion Modules with Pure Embeddings0
Spiritus Asper versus Lambda: On the Nature of Functional Abstraction0
A Natural Deduction Calculus for S4.20
A Nonsplitting Theorem in the Low2 Turing Degrees0
The Marker–Steinhorn Theorem0
No Decreasing Sequence of Cardinals in the Hierarchy of Choice Principles0
Modal Logics That Are Both Monotone and Antitone: Makinson’s Extension Results and Affinities between Logics0
Responsibility in Infinite Games0
The Principle of Open Induction on [0,1] and the Approximate-Fan Theorem0
Characterizing Counterfactuals and Dependencies over (Generalized) Causal Teams0
On Sylow Theory for Linear Pseudofinite Groups0
Classical Mereology Is Axiomatizable Using Primitive Fusion in Two-Sorted Logic0
On VC-Density in VC-Minimal Theories0
Quasi-Polyadic Algebras and Their Dual Position0
Split Principles0
Tame Topology over Definable Uniform Structures0
Embeddings between Partial Combinatory Algebras0
Beyond Berkson: Further Light on the Selection Bias0
0.24377918243408