archive
Every paper Pith has read. Search by title, abstract, or pith.
145 papers in math.LO · page 1
-
Soluble p-Lie algebras of finite Morley rank get characterized
On p-Lie algebras of finite Morley rank
-
O-minimal open core fails to be an elementary property
O-minimal open core is not an elementary property
-
The paper treats ultrametric spaces as two-sorted structures of points plus an ordered…
Universal homogeneous two-sorted ultrametric spaces
-
Finitely generated G outside C ties amenability to Thompson F
Groups with classifiable actions on the line
-
Calculus measures linear logic proofs with real numbers
Quantitative Linear Logic
-
Sequent calculi for CS, CSM, ER prove Lyndon interpolation
Proof Theory for Bimodal Provability Logics
-
Model theories reduce to infinite-dimensional spaces over simpler bases
Trace definability III: Infinite dimensional space over a model of $T$
-
Field appears in Shelah completion of group-free weakly o-minimal structure
Trace definability II: model-theoretic linearity
-
Minimal sequence collections detect discontinuities
On minimal collections of sequences for testing continuity
-
ZFC proves adp equals dp
Almost Disjointness Principles and $Q$-Space Cardinals
-
FOMOD logic testable in constant time on finitary graphs
Constant time testability of first-order logic with modulo counting on finitary graphs
-
Non-definable sets in R^2 become approximately definable in the reals
Some model-theoretic consequences of high-arity uniform convergence, part I
-
Algebraic closure properties define pseudo-elementary classes
Algebraic characterisation of pseudo-elementary and second-order classes
-
Skewed ultralimits map Ramsey ultrafilter types to omega ultrapowers
On skew ultralimits and their applications in ultrafilter theory
-
Box topologies define κ-meagre sets for singular cardinals
Topology and category for singular product spaces
-
Nonstandard analysis shortens Radon-Nikodym proof
A Short Nonstandard Proof of the Radon-Nikodym Theorem
-
Combinatorial property identifies all projections of strongly compact Prikry forcing
On the Intermediate Models of Strongly Compact Prikry Forcing
-
Generalized Jacobian points recover curve data up to twist
A curve and its abstract generalized Jacobian
-
Simple pp expansions match mono-reflective subcategories
A categorical description of simple Beth companions
-
Ultrafilter quotients characterize self-divisible ultrafilters
Reply to Some Questions of Quotients when ultrafilters divide ultrafilters
-
Base lattice unifies logics to track information evolution
On Many-logic modal structures and information-based logics
-
Torsion-free groups yield first natural non-tame AECs
Examples of non-tame abstract elementary classes of abelian groups
-
One equation captures bounded depth in Hilbert algebras
Bounded depth in Hilbert algebras
-
Well-ordered LUBs suffice for fixed points and maximal elements
Bourbaki--Zorn Normal Forms for Maximality Arguments
-
LUBs on well-ordered subsets imply maximal elements
Bourbaki--Zorn Normal Forms for Maximality Arguments
-
Right-hand side regularity fixes ODE solving difficulty
Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
-
Fixed neural networks with definable layers have finite PAC sample complexity
Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity
-
Definable fields in t-minimal theories are finite or large
Definable groups and fields in t-minimal theories
-
First-order formulae are concise in acylindrically hyperbolic groups
Concise formulae in groups of non-positive curvature
-
Choice-switches remain dependent on button systems
A note on the modal logic of symmetric extensions
-
Inferon replaces truth as information's core unit
Towards an Inferentialist Account of Information Through Proof-theoretic Semantics
-
Inferentialist account replaces truth with inferability in information theory
Towards an Inferentialist Account of Information Through Proof-theoretic Semantics
-
λ-complete sets extend to saturated models over predicates
On $\lam$-existence over a predicate
-
Strong n-distality yields hypergraph regularity in NIP theories
On n-distality, n-triviality and hypergraph regularity in NIP theories
-
Continuations embody semantic intuitions in intuitionistic logic
Continuations and Completeness in Proof-theoretic Semantics
-
Subshift finite determination equals co-language Ziegler reducibility
Comparing the Effective Content of Subshifts
-
Coalition abilities split into four exhaustive categories including full inability
Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
-
Friedman-Stanley map preserves Scott sentence complexity
Computable Scott Sentences and the Friedman-Stanley embedding
-
Point-free relations recovered from a parallel pair of frame operators
Localic Relations with Open Cones
-
One model fixes true or false for every core math statement about reals
A Foundation for the Core Mathematician
-
Every countable-to-one coloring on ω₂ has an injective closed ω₁ copy
A Topological Rainbow Ramsey Theorem
-
Closed ω₁ rainbow for any countable-to-one pair coloring on ω₂
A Topological Rainbow Ramsey Theorem
-
The paper proves that in a pseudo-finite group with the descending chain condition on…
Solvability of the radical in pseudo-finite groups with the DCC on centralizers up to finite index
-
Free-set and rainbow theorems extend to barriers
Free sets, thin sets and rainbows for barriers
-
Model yields Π¹₂ equivalence relation not generated by projective functions
A locally countable graph of second projective class not generated by countably many projective functions
-
Model yields Π¹₂ equivalence relation without projective generators
A locally countable graph of second projective class not generated by countably many projective functions
-
Some c.e
A Computably Enumerable $tt$-Degree Without Computably Enumerable Irreducible $m$-Degrees
-
K-holomorphic functions characterized by real-part analyticity
$K$-holomorphic functions with definable real part
-
Universal theories capture extension satisfiability in finitary logics
More on expressibility of satisfiability in submodels and extensions
-
Certain subsets of rationals allow computable tests with finite errors
Computability Limits of Sequential Hypothesis Testing