archive
Every paper Pith has read. Search by title, abstract, or pith.
407 papers in math.LO · page 9
-
Logic reduces time-stamped claim sets via trust relations
Time-Stamped Claim Logic
-
Model theory recasts operator algebra classifications
An Introduction to Abstract Classification Theory in the Operator Algebraic Setting
-
Delta language defines programs as list-formulas checked on dynamic models
Delta -- new logic programming language and Delta-methodology for p-computable programs on Turing Complete Languages
-
Cut-free sequent calculi prove interpolation for weak negation logics
Proof Theory for Positive Logic with Weak Negation
-
Gödel modal logics not realized by basic justification logics
Standard G\"odel modal logics are not realized by G\"odel justification logics
-
ILP0 and ILR complete for generalized Veltman semantics
Interpretability logics and generalized Veltman semantics
-
Tree property at aleph_n consistent with any continuum below aleph_omega
Easton's theorem for the tree property below aleph_omega
-
Torsion-free hyperbolic groups homogeneous via JSJ of free factors
Homogeneity of torsion-free hyperbolic groups
-
Parallelized Σ¹₁-choice on integers gets its Weihrauch degree fixed
A comparison of various analytic choice principles
-
AD implies DC inside countably iterable passive mice
The Axiom of Determinacy Implies Dependent Choices in Mice
-
Unsharp residuation organizes posets into effect algebras
Unsharp residuation in effect algebras
-
All linear dependencies of CM points on elliptic curves are described
Independence of CM points in Elliptic Curves
-
Homogeneous partitions obey a dual Ramsey theorem
Homogeneous Dual Ramsey Theorem
-
Age algebras of metrically homogeneous graphs are polynomial
The Algebra of an Age for Metrically Homogeneous Graphs of Generic Type
-
UMP holds exactly when the logic is compact
Metastable convergence and logical compactness
-
Upper bounds close gap on graph minor theorem strength
Upper bounds on the graph minor theorem
-
Computability theory ranks Lebesgue space classification difficulty
On the complexity of classifying Lebesgue spaces
-
F_sigma game determinacy of length omega^2 equals reflective KP+AD model
$F_\sigma$ Games and Reflection in $L(\mathbb{R})$
-
Borel games of length ω² determined iff extender models exist
Long Borel Games
-
Formula valid exactly when it has a lax fibration proof
First-order proofs without syntax
-
Topological many-one degrees of real functions fully described
Topological reducibilities for discontinuous functions and their structures
-
Admissible ordinals can be OTM-clockable but Σ₂ ones cannot
A Note on Clockability for Ordinal Turing Machines
-
Forcing from supercompact yields model of ZF+DC_κ without κ-mad families
On the non-existence of $\kappa$-mad families
-
Homotopy theory developed synthetically in type theory
Classifying Types
-
Compactness for pseudopowers proven when σ regular and ≤ cf(μ)
Representability and Compactness for Pseudopowers
-
Simulation model shows P=NP cannot be proved
Computer-Simulation Model Theory (P= NP is not provable)