Archive for Mathematical Logic

Article	Citations
Logics of left variable inclusion and Płonka sums of matrices	9
Quantum logic is undecidable	5
Degree structures of conjunctive reducibility	4
Normalisation and subformula property for a system of classical logic with Tarski’s rule	4
First-order concatenation theory with bounded quantifiers	3
Towards a homotopy domain theory	3
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts	3
The existence of states based on Glivenko semihoops	3
Small $$\mathfrak {u}(\kappa )$$ at singular $$\kappa $$ with compactness at $$\kappa ^{++}$$	3
The absorption law	3
Towers and clubs	3
Easton collapses and a strongly saturated filter	3
A few more dissimilarities between second-order arithmetic and set theory	2
Second order arithmetic as the model companion of set theory	2
Tree-like constructions in topology and modal logic	2
A note on cut-elimination for classical propositional logic	2
Strong downward Löwenheim–Skolem theorems for stationary logics, I	2
On the spectra of cardinalities of branches of Kurepa trees	2
Ring structure theorems and arithmetic comprehension	2
Reflection and not SCH with overlapping extenders	2
Condensable models of set theory	2
Coanalytic ultrafilter bases	2
Bachmann–Howard derivatives	2
Iterated multiplication in $$ VTC ^0$$	2
Weak essentially undecidable theories of concatenation	2

Many different uniformity numbers of Yorioka ideals	2
$$AD_{\mathbb {R}}$$ implies that all sets of reals are $$\Theta $$ universally Baire	2
Axiomatic theory of betweenness	1
Type space functors and interpretations in positive logic	1
On ultrafilter extensions of first-order models and ultrafilter interpretations	1
Another method for constructing models of not approachability and not SCH	1
$$sQ_1$$-degrees of computably enumerable sets	1
Sofic profiles of $$S(\omega )$$ and computability	1
The fixed point and the Craig interpolation properties for sublogics of $$\textbf{IL}$$	1
Short note: Least fixed points versus least closed points	1
Cichoń’s diagram and localisation cardinals	1
A note on uniform density in weak arithmetical theories	1
Some implications of Ramsey Choice for families of $$\varvec{n}$$-element sets	1
Filter pairs and natural extensions of logics	1
Pseudointersection numbers, ideal slaloms, topological spaces, and cardinal inequalities	1
On countably saturated linear orders and certain class of countably saturated graphs	1
On extendability to $$F_\sigma $$ ideals	1
Model completeness and relative decidability	1
Model theory of monadic predicate logic with the infinity quantifier	1
Combinatorial properties and dependent choice in symmetric extensions based on Lévy collapse	1
Dividing lines in unstable theories and subclasses of Baire 1 functions	1
Computable scott sentences for quasi–Hopfian finitely presented structures	1
Forcing the Mapping Reflection Principle by finite approximations	1
Monadic $$k\times j$$-rough Heyting algebras	1
Glivenko sequent classes and constructive cut elimination in geometric logics	1
Mutual algebraicity and cellularity	1
Multiplicative finite embeddability vs divisibility of ultrafilters	1
On Hilbert algebras generated by the order	1
Strong cell decomposition property in o-minimal traces	1
Definable groups in dense pairs of geometric structures	1
Representability and compactness for pseudopowers	1
Various forms of infinity for finitely supported structures	1
Proof-theoretic uniform boundedness and bounded collection principles and countable Heine–Borel compactness	1
Special ultrafilters and cofinal subsets of $$({}^\omega \omega , <^*)$$	1
Hanf numbers for extendibility and related phenomena	1
Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum	1
Ranks based on strong amalgamation Fraïssé classes	1
An ordinal-connection axiom as a weak form of global choice under the GCH	0
Mathias and silver forcing parametrized by density	0
A boundedness principle for the Hjorth rank	0
Cut elimination for coherent theories in negation normal form	0
Efficient elimination of Skolem functions in $$\text {LK}^\text {h}$$	0
Monotonic modal logics with a conjunction	0
An infinitary propositional probability logic	0
First-order theories of bounded trees	0
Rosenthal families, filters, and semifilters	0
Computable approximations of a chainable continuum with a computable endpoint	0
Disjunctive logic programs, answer sets, and the cut rule	0
Involutive symmetric Gödel spaces, their algebraic duals and logic	0
$$\Delta ^0_1$$ variants of the law of excluded middle and related principles	0

Implicit recursion-theoretic characterizations of counting classes	0
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets	0
Pcf without choice Sh835	0
The abstract type of the real numbers	0
Sprague–Grundy theory in bounded arithmetic	0
On computable numberings of families of Turing degrees	0
Compositional truth with propositional tautologies and quantifier-free correctness	0
On forcing over $$L(\mathbb {R})$$	0
Nondefinability results with entire functions of finite order in polynomially bounded o-minimal structures	0
Wellfoundedness proof with the maximal distinguished set	0
On the isomorphism problem for some classes of computable algebraic structures	0
The structure of $$\kappa $$-maximal cofinitary groups	0
Towers, mad families, and unboundedness	0
The axiom of choice in metric measure spaces and maximal $$\delta $$-separated sets	0
Big Ramsey degrees in universal inverse limit structures	0
Definable connectedness of randomizations of groups	0
Recursive Polish spaces	0
Interpreting the compositional truth predicate in models of arithmetic	0
Semi-honest subrecursive degrees and the collection rule in arithmetic	0
A fixed-point theorem for definably amenable groups	0
Remarks on weak amalgamation and large conjugacy classes in non-archimedean groups	0
Varieties of truth definitions	0
A Mathias criterion for the Magidor iteration of Prikry forcings	0
Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces	0
Models of $${{\textsf{ZFA}}}$$ in which every linearly ordered set can be well ordered	0
Does weak quasi-o-minimality behave better than weak o-minimality?	0
The small index property for countable superatomic boolean algebras	0
Ideals with Smital properties	0
Some complete $$\omega $$-powers of a one-counter language, for any Borel class of finite rank	0
Preservation properties for products and sums of metric structures	0
An AEC framework for fields with commuting automorphisms	0
Prenex normalization and the hierarchical classification of formulas	0
Pointwise complexity of the derivative of a computable function	0
Definable Tietze extension property in o-minimal expansions of ordered groups	0
Weak essentially undecidable theories of concatenation, part II	0
On the rigidity of Souslin trees and their generic branches	0
Infinite decreasing chains in the Mitchell order	0
The independence of $$\mathsf {GCH}$$ and a combinatorial principle related to Banach–Mazur games	0
Effective weak and vague convergence of measures on the real line	0
Antichains of copies of ultrahomogeneous structures	0
Keisler’s order via Boolean ultrapowers	0
A criterion for uniform finiteness in the imaginary sorts	0
Correction to: Generalization of Shapiro’s theorem to higher arities and noninjective notations	0
The second-order version of Morley’s theorem on the number of countable models does not require large cardinals	0
Hereditary G-compactness	0
Independence-friendly logic without Henkin quantification	0
A criterion for the strong cell decomposition property	0
Indestructibility and the linearity of the Mitchell ordering	0
On decidability of amenability in computable groups	0
Herbrand complexity and the epsilon calculus with equality	0
Involutive Uninorm Logic with Fixed Point enjoys finite strong standard completeness	0
Reverse mathematics and semisimple rings	0
On well-splitting posets	0
Generic existence of interval P-points	0
24th Workshop on Logic, Language, Information and Computation—WoLLIC 2017	0
Convergence of measures after adding a real	0
Generalization of Shapiro’s theorem to higher arities and noninjective notations	0
Questions on cardinal invariants of Boolean algebras	0
On Harrop disjunction property in intermediate predicate logics	0
Equivalence of generics	0
Factorizing the $$\mathbf {Top}$$–$$\mathbf {Loc}$$ adjunction through positive topologies	0
Computability and the game of cops and robbers on graphs	0
Regressive versions of Hindman’s theorem	0
Superrosiness and dense pairs of geometric structures	0
Vector spaces with a union of independent subspaces	0
Correction to: Towers, mad families, and unboundedness	0
Destructibility and axiomatizability of Kaufmann models	0
Continuous logic and embeddings of Lebesgue spaces	0
On diagonal functions for equivalence relations	0
The automorphism group and definability of the jump operator in the $$\omega $$-enumeration degrees	0
A topological completeness theorem for transfinite provability logic	0
Essential hereditary undecidability	0
Cut elimination by unthreading	0
On the complexity of the theory of a computably presented metric structure	0
Positive logics	0
Learning theory in the arithmetic hierarchy II	0
On the non-existence of $$\kappa $$-mad families	0
Maximal Tukey types, P-ideals and the weak Rudin–Keisler order	0
Turing degrees and randomness for continuous measures	0
The covering number of the strong measure zero ideal can be above almost everything else	0

Hindman’s theorem for sums along the full binary tree, $$\Sigma ^0_2$$-induction and the Pigeonhole principle for trees	0
L-domains as locally continuous sequent calculi	0
Knowledge, behavior, and rationality: rationalizability in epistemic games	0
Combinatory logic with polymorphic types	0
Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization	0
Cohesive powers of structures	0
Around accumulation points and maximal sequences of indiscernibles	0
On the topological dynamics of automorphism groups: a model-theoretic perspective	0
Structure of semisimple rings in reverse and computable mathematics	0
The theories of Baldwin–Shi hypergraphs and their atomic models	0
Enhancing induction in a contraction free logic with unrestricted abstraction: from $$\mathbf {Z}$$ to $$\mathbf {Z}_2$$	0
Formalism and Hilbert’s understanding of consistency problems	0
The additive structure of integers with the lower Wythoff sequence	0
Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms	0
Tameness in generalized metric structures	0
Selection properties of the split interval and the Continuum Hypothesis	0
Small sets in Mann pairs	0
Generalised stability of ultraproducts of finite residue rings	0
Revisiting the conservativity of fixpoints over intuitionistic arithmetic	0
Characterising Brouwer’s continuity by bar recursion on moduli of continuity	0
An alternative proof of the Hilbert-style axiomatization for the $$\{\wedge ,\vee \}$$-fragment of classical propositional logic	0
Indiscernibles and satisfaction classes in arithmetic	0
Independent families and some notions of finiteness	0
On the extendability to $$\mathbf {\Pi }_3^0$$ ideals and Katětov order	0
Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning	0
Stably embedded submodels of Henselian valued fields	0
Consistency and interpolation in linear continuous logic	0
A syntactic approach to Borel functions: some extensions of Louveau’s theorem	0
Errata: on the role of the continuum hypothesis in forcing principles for subcomplete forcing	0