archive
Every paper Pith has read. Search by title, abstract, or pith.
407 papers in math.LO · page 1
-
Left coarse structures on quotients do not always match
Coarse Structures on Homogeneous Spaces
-
Polish groups' coarse structures metrisable under local boundedness
The geometrisation problem for topological groups
-
Tilting preserves arithmetic definability of henselian valuations
Definability via the tilting correspondence
-
Stability equals strong minimality for geometric field theories
Geometric fields, ranks, and generic derivations
-
k-triviality collapses to 1-triviality in simple theories
Higher-arity distality and forking triviality
-
Categorical coherent theories dualize to profinite monoids
Duality theory for categorical theories
-
Ultrapower of spectral subspace is proper subset of spectral subspace of ultrapower
Ultrapowers of spectral subspaces
-
Rado graph has the finite length property
The Finite Length Property of the Rado Graph and Friends
-
Meet-relations establish duality for semilattices with adjunctions
From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions
-
Gamified Katětov order embeds P(ω)/Fin
The Gamified Kat\v{e}tov order is not linear (in fact, very much not so)
-
Infinite-exponent partitions on orders and graphs break weak choice
Structural Infinite-Exponent Partition Relations and Weak Choice Principles
-
Interval partitions match classical b and d for universal cases
Revisiting $\mathfrak b$ and $\mathfrak d$ through Interval Structures
-
Hyperarithmetic functions listed by dominating reals with low hyperjump
Listing the hyperarithmetical functions
-
Forcing over L yields Martin's Axiom with aleph3 continuum and projective uniformization
Martin's Axiom, Large Continuum and Global $\Sigma^1_n$-Uniformization
-
Model of ZFC makes Π¹₃ function graphs Σ¹₃
On graphs of total projective functions
-
Forcing establishes Σ¹₁ separation on ω₁^ω₁
Forcing $\mathbf{\Sigma}^1_1$-Separation on $\omega_1^{\omega_1}$
-
Two games characterize generalized quantifier separability
Model Comparison Games for Generalized Quantifiers
-
Initial segments of Dyment lattices model exact intuitionistic logic
Intuitionism and computing with partial information
-
New VF logic proven strictly weaker than WF
Very weak subintuitionistic logics
-
Fixed sets of automorphisms fully characterized for saturated countable structures
Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures
-
Four properties in refined A-translation have no recursive definition
On the Limits of Recursive Characterizations in the Refined $A$-Translation
-
Four properties in refined A-translation lack recursive characterizations
On the Limits of Recursive Characterizations in the Refined $A$-Translation
-
Localic groupoids classify strictly more logical theories than toposes
Generic bundles over a localic category
-
Localic groupoids classify strictly more logical theories than toposes
Generic bundles over a localic category
-
ℓ² Betti number non-decreasing under first-order embeddings
An $\ell^2$ Obstruction for Elementary Embeddings of Hyperbolic Groups
-
k-trace definability finds universal k-NIP theories inside NIP bases
Trace definability IV: higher arity notions
5 Piths -
Sequent system proves positive formulas match GL implications
A proof system for the positive fragment of GL
-
min{b, cov^+_h(J)} bounds antichain numbers for many Borel ideals
On antichain numbers and the splitting ideal
-
Dual completeness conditions block consistent closure predicates
Remarks on Primitive Regulation
-
FHP theories extend NIP into low NTP2 with new field examples
Fractional Helly property and combinatorics of forking in NTP$_2$ theories
-
Characterization yields free Schur ultrafilter on Z
Combinatorics of Schur ultrafilters
-
Display calculi extended to non-analytic inductive axioms
Inception Display Calculi
-
Display calculi prove Lyndon interpolation for nondistributive logics
Modular constructive Lyndon interpolation for nondistributive logics
-
rgs and irgs characterize stable random type extensions
Keisler Measures and Generically Stable Random Types
-
Natural extensions fail to complete modal Gödel logics on finite models
Axiomatizing logics of finite G\"odel-Kripke models
-
Modal group theory under homomorphisms equals true arithmetic
Modal group theory: homomorphisms
3 Piths -
Slow Cauchy sequences let real analysis stay conservative over RCA0
Avoiding logical strength in real analysis
-
Guises encode relations as internal perspectives
Guises and Perspectives: An Intentional and Hyperintensional Sketch
-
Higher sheaf models of type theory built constructively
Constructive higher sheaf models with applications to synthetic mathematics
-
Higher sheaf models of univalent type theory built constructively
Constructive higher sheaf models with applications to synthetic mathematics
-
Ambrose Spotted Logic Convention Paradoxes in 1931
Alice Ambrose on Logic, A Priori Concepts, and the Epistemology of Convention
-
Ambrose keeps extensional logic rigorous without material infinity
Extensionalism without Logicism: Ambrose and Extensional Logic
-
Quasi-Polish spaces get equivalent arithmetic forms
Quasi-Polish spaces and spaces of filters in second-order arithmetic
-
Tame groups encode any countable structure in finite extensions
Model-theoretic Tameness in finite extensions of groups
-
Group embeddings validate modal logic S4.2
Modal group theory
2 Piths -
42-point graph gives finite representation for 30_65
Relation Algebra Representations from Distance-Regular Graphs
-
Modal logic eliminates modalities on linear orders under embeddings
The modal theory of linear orders
-
This note surveys how the Lawvere-Tierney order in the Effective Topos connects to a…
What can Topology tell us about Logical Complexity?
-
Perfect graphs characterize duality in combinatorial Banach spaces
Geometric duality, perfect graphs, and the Sierpi\'nski space
-
Hoare logic equivalent to second-order logic with first-order predicates
A foundational characterization of Hoare Logic
2 Piths