Archive for Mathematical Logic

Papers
(The TQCC of Archive for Mathematical Logic is 1. 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-05-01 to 2024-05-01.)
ArticleCitations
Quantum logic is undecidable6
Degree structures of conjunctive reducibility4
Easton collapses and a strongly saturated filter4
Normalisation and subformula property for a system of classical logic with Tarski’s rule4
First-order concatenation theory with bounded quantifiers3
The existence of states based on Glivenko semihoops3
Small $$\mathfrak {u}(\kappa )$$ at singular $$\kappa $$ with compactness at $$\kappa ^{++}$$3
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts3
Pseudointersection numbers, ideal slaloms, topological spaces, and cardinal inequalities3
Towers and clubs3
The absorption law3
Many different uniformity numbers of Yorioka ideals3
Towards a homotopy domain theory3
Mutual algebraicity and cellularity2
Coanalytic ultrafilter bases2
On the spectra of cardinalities of branches of Kurepa trees2
Iterated multiplication in $$ VTC ^0$$2
Ring structure theorems and arithmetic comprehension2
Glivenko sequent classes and constructive cut elimination in geometric logics2
On ultrafilter extensions of first-order models and ultrafilter interpretations2
A few more dissimilarities between second-order arithmetic and set theory2
Weak essentially undecidable theories of concatenation2
Tree-like constructions in topology and modal logic2
A note on cut-elimination for classical propositional logic2
Condensable models of set theory2
Bachmann–Howard derivatives2
Cichoń’s diagram and localisation cardinals2
Second order arithmetic as the model companion of set theory2
Reflection and not SCH with overlapping extenders2
A note on uniform density in weak arithmetical theories1
Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum1
Axiomatic theory of betweenness1
Monotonic modal logics with a conjunction1
Convergence of measures after adding a real1
Model completeness and relative decidability1
Sofic profiles of $$S(\omega )$$ and computability1
Various forms of infinity for finitely supported structures1
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine–Borel compactness1
Computable scott sentences for quasi–Hopfian finitely presented structures1
Hanf numbers for extendibility and related phenomena1
Some implications of Ramsey Choice for families of $$\varvec{n}$$-element sets1
Ranks based on strong amalgamation Fraïssé classes1
Multiplicative finite embeddability vs divisibility of ultrafilters1
On countably saturated linear orders and certain class of countably saturated graphs1
On extendability to $$F_\sigma $$ ideals1
Another method for constructing models of not approachability and not SCH1
$$sQ_1$$-degrees of computably enumerable sets1
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse1
The fixed point and the Craig interpolation properties for sublogics of $$\textbf{IL}$$1
Short note: Least fixed points versus least closed points1
Towers, mad families, and unboundedness1
L-domains as locally continuous sequent calculi1
Monadic $$k\times j$$-rough Heyting algebras1
Filter pairs and natural extensions of logics1
Type space functors and interpretations in positive logic1
On Hilbert algebras generated by the order1
Strong cell decomposition property in o-minimal traces1
Representability and compactness for pseudopowers1
Model theory of monadic predicate logic with the infinity quantifier1
Dividing lines in unstable theories and subclasses of Baire 1 functions1
Definable groups in dense pairs of geometric structures1
Forcing the Mapping Reflection Principle by finite approximations1
0.056918859481812