The GHZ/W-calculus contains rational arithmetic
The Hamiltonian Syllogistic
The Heap Lambda Machine
The Inhabitation Problem for Rank Two Intersection Types
The intuitionistic fragment of computability logic at the propositional level
The Inverse Method Implements the Automata Approach for Modal Satisfiability
The Isomorphism Problem for omega-Automatic Trees
The Isomorphism Problem On Classes of Automatic Structures
The Kleene-Rosser Paradox, The Liar's Paradox & A Fuzzy Logic Programming Paradox Imply SAT is (NOT) NP-complete
The lambda-mu-T-calculus
The Last Paper on the Halpern-Shoham Interval Temporal Logic
The Liar and Related Paradoxes: Fuzzy Truth Value Assignment for Collections of Self-Referential Sentences
The Limits of Horn Logic Programs
The logic of interactive Turing reduction
The Magic of Logical Inference in Probabilistic Programming
The monadic second-order logic of graphs XVI : Canonical graph<br> decompositions
The Omega Rule is $\mathbf{Π_{1}^{1}}$-Complete in the $λβ$-Calculus
The One Page Model Checker
The parallel versus branching recurrences in computability logic
The prospects for mathematical logic in the twenty-first century