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