Archive for Mathematical Logic

Papers
(The median citation count of Archive for Mathematical 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 2020-02-01 to 2024-02-01.)
ArticleCitations
Logics of left variable inclusion and Płonka sums of matrices8
Classifying equivalence relations in the Ershov hierarchy6
Quantum logic is undecidable5
Normalisation and subformula property for a system of classical logic with Tarski’s rule4
First-order concatenation theory with bounded quantifiers3
Towards a homotopy domain theory3
Easton collapses and a strongly saturated filter3
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts3
Small $$\mathfrak {u}(\kappa )$$ at singular $$\kappa $$ with compactness at $$\kappa ^{++}$$3
The absorption law3
Towers and clubs3
Degree structures of conjunctive reducibility3
Second order arithmetic as the model companion of set theory2
Iterated multiplication in $$ VTC ^0$$2
A note on cut-elimination for classical propositional logic2
Condensable models of set theory2
Coanalytic ultrafilter bases2
Bachmann–Howard derivatives2
Weak essentially undecidable theories of concatenation2
Tree-like constructions in topology and modal logic2
Many different uniformity numbers of Yorioka ideals2
Kurepa trees and spectra of $${\mathcal {L}}_{\omega _1,\omega }$$-sentences2
On the spectra of cardinalities of branches of Kurepa trees2
Ring structure theorems and arithmetic comprehension2
The existence of states based on Glivenko semihoops2
$$AD_{\mathbb {R}}$$ implies that all sets of reals are $$\Theta $$ universally Baire2
Strong downward Löwenheim–Skolem theorems for stationary logics, I2
Model completeness and relative decidability1
The fixed point and the Craig interpolation properties for sublogics of $$\textbf{IL}$$1
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse1
Model theory of monadic predicate logic with the infinity quantifier1
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine–Borel compactness1
Cichoń’s diagram and localisation cardinals1
A note on uniform density in weak arithmetical theories1
Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum1
Pseudointersection numbers, ideal slaloms, topological spaces, and cardinal inequalities1
Glivenko sequent classes and constructive cut elimination in geometric logics1
On ultrafilter extensions of first-order models and ultrafilter interpretations1
Classifying material implications over minimal logic1
Representability and compactness for pseudopowers1
Dividing lines in unstable theories and subclasses of Baire 1 functions1
Various forms of infinity for finitely supported structures1
Short note: Least fixed points versus least closed points1
Forcing the Mapping Reflection Principle by finite approximations1
Some implications of Ramsey Choice for families of $$\varvec{n}$$-element sets1
Mutual algebraicity and cellularity1
Type space functors and interpretations in positive logic1
On countably saturated linear orders and certain class of countably saturated graphs1
Strong cell decomposition property in o-minimal traces1
A Mathias criterion for the Magidor iteration of Prikry forcings1
Sofic profiles of $$S(\omega )$$ and computability1
$$sQ_1$$-degrees of computably enumerable sets1
A few more dissimilarities between second-order arithmetic and set theory1
Hanf numbers for extendibility and related phenomena1
Reflection and not SCH with overlapping extenders1
Monadic $$k\times j$$-rough Heyting algebras1
Axiomatic theory of betweenness1
Multiplicative finite embeddability vs divisibility of ultrafilters1
On Hilbert algebras generated by the order1
A version of $$\kappa $$-Miller forcing1
Combinatory logic with polymorphic types0
A boundedness principle for the Hjorth rank0
Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$0
An ordinal-connection axiom as a weak form of global choice under the GCH0
$$\Delta ^0_1$$ variants of the law of excluded middle and related principles0
Computable approximations of a chainable continuum with a computable endpoint0
Weak essentially undecidable theories of concatenation, part II0
Keisler’s order via Boolean ultrapowers0
Correction to: Generalization of Shapiro’s theorem to higher arities and noninjective notations0
Disjunctive logic programs, answer sets, and the cut rule0
Knowledge, behavior, and rationality: rationalizability in epistemic games0
Tanaka’s theorem revisited0
Generalization of Shapiro’s theorem to higher arities and noninjective notations0
A criterion for the strong cell decomposition property0
Questions on cardinal invariants of Boolean algebras0
Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms0
Involutive symmetric Gödel spaces, their algebraic duals and logic0
Factorizing the $$\mathbf {Top}$$–$$\mathbf {Loc}$$ adjunction through positive topologies0
Formalism and Hilbert’s understanding of consistency problems0
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness0
On forcing over $$L(\mathbb {R})$$0
Mathias and silver forcing parametrized by density0
Superrosiness and dense pairs of geometric structures0
On extendability to $$F_\sigma $$ ideals0
On the isomorphism problem for some classes of computable algebraic structures0
Definable groups in dense pairs of geometric structures0
Correction to: Towers, mad families, and unboundedness0
Convergence of measures after adding a real0
Towers, mad families, and unboundedness0
Generalised stability of ultraproducts of finite residue rings0
A topological completeness theorem for transfinite provability logic0
Equivalence of generics0
Special ultrafilters and cofinal subsets of $$({}^\omega \omega , <^*)$$0
Cut elimination by unthreading0
Implicit recursion-theoretic characterizations of counting classes0
An alternative proof of the Hilbert-style axiomatization for the $$\{\wedge ,\vee \}$$-fragment of classical propositional logic0
Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces0
Fields with automorphism and valuation0
A diamond-plus principle consistent with AD0
Another method for constructing models of not approachability and not SCH0
Some complete $$\omega $$-powers of a one-counter language, for any Borel class of finite rank0
Ranks based on strong amalgamation Fraïssé classes0
The abstract type of the real numbers0
An infinitary propositional probability logic0
Definable Tietze extension property in o-minimal expansions of ordered groups0
Preservation properties for products and sums of metric structures0
First-order theories of bounded trees0
Effective weak and vague convergence of measures on the real line0
Maximal Tukey types, P-ideals and the weak Rudin–Keisler order0
End extensions of models of fragments of PA0
Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization0
On the independence of premiss axiom and rule0
Local reflection, definable elements and 1-provability0
Bounded-low sets and the high/low hierarchy0
Independence-friendly logic without Henkin quantification0
Turing degrees and randomness for continuous measures0
Characterising Brouwer’s continuity by bar recursion on moduli of continuity0
Structure of semisimple rings in reverse and computable mathematics0
Compositional truth with propositional tautologies and quantifier-free correctness0
The axiom of choice in metric measure spaces and maximal $$\delta $$-separated sets0
Positive logics0
Scattered sentences have few separable randomizations0
The structure of $$\kappa $$-maximal cofinitary groups0
On decidability of amenability in computable groups0
An AEC framework for fields with commuting automorphisms0
Stably embedded submodels of Henselian valued fields0
Tameness in generalized metric structures0
The theories of Baldwin–Shi hypergraphs and their atomic models0
Reverse mathematics and semisimple rings0
A syntactic approach to Borel functions: some extensions of Louveau’s theorem0
Revisiting the conservativity of fixpoints over intuitionistic arithmetic0
Generic existence of interval P-points0
Interpreting the compositional truth predicate in models of arithmetic0
Cut elimination for coherent theories in negation normal form0
Selection properties of the split interval and the Continuum Hypothesis0
Chang’s Conjecture with $$\square _{\omega _1, 2}$$ from an $$\omega _1$$-Erdős cardinal0
Regressive versions of Hindman’s theorem0
Learning theory in the arithmetic hierarchy II0
Remarks on weak amalgamation and large conjugacy classes in non-archimedean groups0
Consistency and interpolation in linear continuous logic0
The independence of $$\mathsf {GCH}$$ and a combinatorial principle related to Banach–Mazur games0
Does weak quasi-o-minimality behave better than weak o-minimality?0
A criterion for uniform finiteness in the imaginary sorts0
The automorphism group and definability of the jump operator in the $$\omega $$-enumeration degrees0
L-domains as locally continuous sequent calculi0
Continuous logic and embeddings of Lebesgue spaces0
Hereditary G-compactness0
On the rigidity of Souslin trees and their generic branches0
On the non-existence of $$\kappa $$-mad families0
Monotonic modal logics with a conjunction0
Infinite decreasing chains in the Mitchell order0
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets0
Filter pairs and natural extensions of logics0
The covering number of the strong measure zero ideal can be above almost everything else0
Sprague–Grundy theory in bounded arithmetic0
Definable connectedness of randomizations of groups0
Antichains of copies of ultrahomogeneous structures0
Recursive Polish spaces0
Ideal generalizations of Egoroff’s theorem0
Prenex normalization and the hierarchical classification of formulas0
A fixed-point theorem for definably amenable groups0
Herbrand complexity and the epsilon calculus with equality0
Computable scott sentences for quasi–Hopfian finitely presented structures0
On the topological dynamics of automorphism groups: a model-theoretic perspective0
On the complexity of the theory of a computably presented metric structure0
Independent families and some notions of finiteness0
On well-splitting posets0
Enhancing induction in a contraction free logic with unrestricted abstraction: from $$\mathbf {Z}$$ to $$\mathbf {Z}_2$$0
On diagonal functions for equivalence relations0
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered0
Big Ramsey degrees in universal inverse limit structures0
Wellfoundedness proof with the maximal distinguished set0
24th Workshop on Logic, Language, Information and Computation—WoLLIC 20170
Ideals with Smital properties0
Semi-honest subrecursive degrees and the collection rule in arithmetic0
The additive structure of integers with the lower Wythoff sequence0
On Harrop disjunction property in intermediate predicate logics0
Pointwise complexity of the derivative of a computable function0
Small sets in Mann pairs0
Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning0
Rosenthal families, filters, and semifilters0
Computability and the game of cops and robbers on graphs0
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$-induction and the Pigeonhole principle for trees0
Destructibility and axiomatizability of Kaufmann models0
The small index property for countable superatomic boolean algebras0
0.044526100158691