On the Concept of Arithmetic Conseqeunce

This paper reinterprets Gödel's second incompleteness theorem through proof-theoretic semantics by demonstrating that while certain arithmetical theories cannot prove their own consistency, they nonetheless semantically support it via a compositional notion of consequence based on inferential roles, thereby reframing incompleteness as a divergence between derivability and internal semantic support rather than a gap between syntax and external truth.

Alexander V. GheorghiuWed, 11 Ma🔢 math

Locally 0\aleph_0-categorical theories and locally Roelcke precompact groups

This paper extends the correspondence between automorphism groups and 0\aleph_0-categorical structures to the locally Roelcke precompact and locally 0\aleph_0-categorical settings by defining the latter, proving a Ryll-Nardzewski theorem, characterizing the associated groups via isometric actions, and establishing that bi-interpretability of structures is equivalent to the isomorphism of their automorphism groups.

Itaï Ben Yaacov, Todor TsankovWed, 11 Ma🔢 math

Counting spaces of functions on separable compact lines

This paper investigates the number of isomorphism types of Banach spaces C(K)C(K) for compact spaces of a given weight, proving that there are exactly $2^\kappatypesforanyuncountableregularcardinal types for any uncountable regular cardinal \kappa,whiledemonstratingthatforseparablecompactlinearlyorderedspacesofweight, while demonstrating that for separable compact linearly ordered spaces of weight \omega_1,thenumberoftypes(rangingfromoneto, the number of types (ranging from one to 2^{\omega_1}$) depends on additional set-theoretic axioms such as the Continuum Hypothesis or Baumgartner's axiom.

Maciej Korpalski, Piotr Koszmider, Witold MarciszewskiTue, 10 Ma🔢 math

Big Ramsey degrees and the two-branching pseudotree

This paper establishes that finite chains within the two-branching countable ultrahomogeneous pseudotree possess finite big Ramsey degrees, specifically determining the degree for chains of length two to be seven, thereby presenting the first example of a countable ultrahomogeneous structure in a finite language where some finite substructures have finite big Ramsey degrees while others have infinite ones.

David Chodounský, Natasha Dobrinen, Thilo WeinertTue, 10 Ma🔢 math

Iterated club shooting and the stationary-logic constructible model

This paper investigates the iteration of the stationary-logic constructible model C(aa)C(\mathtt{aa}) by proving distributivity and stationary-set preservation for countable iterations of club-shooting forcings using mutually stationary sets, and introducing mutually fat sets to achieve stronger results for uncountable iterations, thereby demonstrating the ability to force models where V=C(aa)V=C(\mathtt{aa}) and where iterated C(aa)C(\mathtt{aa}) sequences decrease with arbitrarily large order types.

Ur Ya'arTue, 10 Ma🔢 math