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-11-01 to 2024-11-01.)
ArticleCitations
Towers and clubs6
Normalisation and subformula property for a system of classical logic with Tarski’s rule4
Weak essentially undecidable theories of concatenation4
Degree structures of conjunctive reducibility4
Small $$\mathfrak {u}(\kappa )$$ at singular $$\kappa $$ with compactness at $$\kappa ^{++}$$4
The absorption law3
Towards a homotopy domain theory3
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts3
Pseudointersection numbers, ideal slaloms, topological spaces, and cardinal inequalities3
Iterated multiplication in $$ VTC ^0$$3
The existence of states based on Glivenko semihoops3
Many different uniformity numbers of Yorioka ideals3
Short note: Least fixed points versus least closed points2
Second order arithmetic as the model companion of set theory2
Some implications of Ramsey Choice for families of $$\varvec{n}$$-element sets2
Mutual algebraicity and cellularity2
Condensable models of set theory2
Dividing lines in unstable theories and subclasses of Baire 1 functions2
On the spectra of cardinalities of branches of Kurepa trees2
Monadic $$k\times j$$-rough Heyting algebras2
Glivenko sequent classes and constructive cut elimination in geometric logics2
A note on cut-elimination for classical propositional logic2
Coanalytic ultrafilter bases2
Bachmann–Howard derivatives2
A few more dissimilarities between second-order arithmetic and set theory2
Reflection and not SCH with overlapping extenders2
On Hilbert algebras generated by the order2
On ultrafilter extensions of first-order models and ultrafilter interpretations2
Herbrand complexity and the epsilon calculus with equality1
Sofic profiles of $$S(\omega )$$ and computability1
Games characterizing certain families of functions1
$$sQ_1$$-degrees of computably enumerable sets1
Model theory of monadic predicate logic with the infinity quantifier1
Towers, mad families, and unboundedness1
Computable scott sentences for quasi–Hopfian finitely presented structures1
L-domains as locally continuous sequent calculi1
Ranks based on strong amalgamation Fraïssé classes1
Type space functors and interpretations in positive logic1
Convergence of measures after adding a real1
Representability and compactness for pseudopowers1
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse1
On the complexity of the theory of a computably presented metric structure1
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine–Borel compactness1
Forcing the Mapping Reflection Principle by finite approximations1
Compositional truth with propositional tautologies and quantifier-free correctness1
On the isomorphism problem for some classes of computable algebraic structures1
Monotonic modal logics with a conjunction1
Filter pairs and natural extensions of logics1
On extendability to $$F_\sigma $$ ideals1
Model completeness and relative decidability1
Another method for constructing models of not approachability and not SCH1
Various forms of infinity for finitely supported structures1
The fixed point and the Craig interpolation properties for sublogics of $$\textbf{IL}$$1
Definable groups in dense pairs of geometric structures1
Hanf numbers for extendibility and related phenomena1
The axiom of choice in metric measure spaces and maximal $$\delta $$-separated sets1
Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum1
Multiplicative finite embeddability vs divisibility of ultrafilters1
Positive indiscernibles1
Glivenko–Cantelli classes and NIP formulas0
Positive logics0
The additive structure of integers with the lower Wythoff sequence0
The independence of $$\mathsf {GCH}$$ and a combinatorial principle related to Banach–Mazur games0
Definable Tietze extension property in o-minimal expansions of ordered groups0
On computable numberings of families of Turing degrees0
Prenex normalization and the hierarchical classification of formulas0
Generic existence of interval P-points0
Rosenthal families, filters, and semifilters0
On forcing over $$L(\mathbb {R})$$0
The structure of $$\kappa $$-maximal cofinitary groups0
An infinitary propositional probability logic0
Recursive Polish spaces0
Combinatory logic with polymorphic types0
Reverse mathematics and semisimple rings0
Definable connectedness of randomizations of groups0
Remarks on weak amalgamation and large conjugacy classes in non-archimedean groups0
Generalised stability of ultraproducts of finite residue rings0
Revisiting the conservativity of fixpoints over intuitionistic arithmetic0
Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing0
The Josefson–Nissenzweig theorem and filters on $$\omega $$0
On well-splitting posets0
Nondefinability results with entire functions of finite order in polynomially bounded o-minimal structures0
What would the rational Urysohn space and the random graph look like if they were uncountable?0
Undecidability of indecomposable polynomial rings0
Bounded distributive lattices with strict implication and weak difference0
Square compactness and Lindelöf trees0
Indiscernibles and satisfaction classes in arithmetic0
The abstract type of the real numbers0
On Harrop disjunction property in intermediate predicate logics0
The small index property for countable superatomic boolean algebras0
A syntactic approach to Borel functions: some extensions of Louveau’s theorem0
Effective weak and vague convergence of measures on the real line0
Preservation properties for products and sums of metric structures0
Spectral MV-algebras and equispectrality0
Infinite decreasing chains in the Mitchell order0
Punctually presented structures II: comparing presentations0
Vector spaces with a union of independent subspaces0
On absorption’s formula definable semigroups of complete theories0
Random structures and automorphisms with a single orbit0
Ideals with Smital properties0
Independence-friendly logic without Henkin quantification0
Antichains of copies of ultrahomogeneous structures0
An AEC framework for fields with commuting automorphisms0
Indestructibility and the linearity of the Mitchell ordering0
Pointwise complexity of the derivative of a computable function0
Pathology of submeasures and $$F_{\sigma }$$ ideals0
Turing degrees and randomness for continuous measures0
Wellfoundedness proof with the maximal distinguished set0
Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$-induction and the Pigeonhole principle for trees0
On the non-existence of $$\kappa $$-mad families0
Cohesive powers of structures0
The automorphism group and definability of the jump operator in the $$\omega $$-enumeration degrees0
The theories of Baldwin–Shi hypergraphs and their atomic models0
Separablilty of metric measure spaces and choice axioms0
On decidability of amenability in computable groups0
Equivalence of generics0
On the rigidity of Souslin trees and their generic branches0
Questions on cardinal invariants of Boolean algebras0
Hereditary G-compactness0
Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms0
A criterion for the strong cell decomposition property0
Computability and the game of cops and robbers on graphs0
On undecidability of the propositional logic of an associative binary modality0
Semi-honest subrecursive degrees and the collection rule in arithmetic0
On the extendability to $$\mathbf {\Pi }_3^0$$ ideals and Katětov order0
Katětov order between Hindman, Ramsey and summable ideals0
Tameness in generalized metric structures0
Independent families and some notions of finiteness0
Correction to: Generalization of Shapiro’s theorem to higher arities and noninjective notations0
Cut elimination by unthreading0
On the non-measurability of $$\omega $$-categorical Hrushovski constructions0
Herbrandized modified realizability0
Varieties of truth definitions0
Correction to: Towers, mad families, and unboundedness0
Interpreting the compositional truth predicate in models of arithmetic0
Consistency and interpolation in linear continuous logic0
Stably embedded submodels of Henselian valued fields0
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets0
Disjunctive logic programs, answer sets, and the cut rule0
Fragments of IOpen0
The covering number of the strong measure zero ideal can be above almost everything else0
Essential hereditary undecidability0
Regressive versions of Hindman’s theorem0
Involutive symmetric Gödel spaces, their algebraic duals and logic0
Around accumulation points and maximal sequences of indiscernibles0
A topological completeness theorem for transfinite provability logic0
Quantifier-free induction for lists0
A characterization of strongly computable finite factorization domains0
The second-order version of Morley’s theorem on the number of countable models does not require large cardinals0
A Mathias criterion for the Magidor iteration of Prikry forcings0
Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$0
Generalization of Shapiro’s theorem to higher arities and noninjective notations0
On diagonal functions for equivalence relations0
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness0
Implicit recursion-theoretic characterizations of counting classes0
On the topological dynamics of automorphism groups: a model-theoretic perspective0
Intuitionistic sets and numbers: small set theory and Heyting arithmetic0
A boundedness principle for the Hjorth rank0
Different covering numbers of compact tree ideals0
A criterion for uniform finiteness in the imaginary sorts0
Enhancing induction in a contraction free logic with unrestricted abstraction: from $$\mathbf {Z}$$ to $$\mathbf {Z}_2$$0
The Fan Theorem, its strong negation, and the determinacy of games0
$$\Delta ^0_1$$ variants of the law of excluded middle and related principles0
An alternative proof of the Hilbert-style axiomatization for the $$\{\wedge ,\vee \}$$-fragment of classical propositional logic0
24th Workshop on Logic, Language, Information and Computation—WoLLIC 20170
Structure of semisimple rings in reverse and computable mathematics0
Formalism and Hilbert’s understanding of consistency problems0
Destructibility and axiomatizability of Kaufmann models0
Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning0
Factorizing the $$\mathbf {Top}$$–$$\mathbf {Loc}$$ adjunction through positive topologies0
Does weak quasi-o-minimality behave better than weak o-minimality?0
The provably total functions of basic arithmetic and its extensions0
Big Ramsey degrees in universal inverse limit structures0
Degrees of relations on canonically ordered natural numbers and integers0
On two consequences of CH established by Sierpiński0
Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces0
Free subsets in internally approachable models0
The Tarski–Lindenbaum algebra of the class of strongly constructivizable models with $$\omega $$-stable theories0
The extent of saturation of induced ideals0
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered0
Computable approximations of a chainable continuum with a computable endpoint0
An ordinal-connection axiom as a weak form of global choice under the GCH0
On categoricity of scattered linear orders of constructive ranks0
First-order theories of bounded trees0
Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization0
Weak essentially undecidable theories of concatenation, part II0
On some $$\Sigma ^{B}_{0}$$-formulae generalizing counting principles over $$V^{0}$$0
Knowledge, behavior, and rationality: rationalizability in epistemic games0
Cut elimination for coherent theories in negation normal form0
Sprague–Grundy theory in bounded arithmetic0
Maximal Tukey types, P-ideals and the weak Rudin–Keisler order0
Mathias and silver forcing parametrized by density0
Pcf without choice Sh8350
Superrosiness and dense pairs of geometric structures0
0.036818027496338