archive
Every paper Pith has read. Search by title, abstract, or pith.
407 papers in math.LO · page 6
-
Hausdorff dimension decides winner in tree games
Determining the Winner in Alternating-Move Games
-
Omega-series composition is monotonic in surreal numbers
Monotonicity and a Taylor approximation theorem for transseries
-
Duality unifies algebraic and birelational semantics for CK
Duality for Constructive Modal Logics: from Sahqlvist to Goldblatt-Thomason
-
Logic for repeated experiments built from any base logic
The universal logic of repeated experiments
-
Diophantine problem over power circuits is undecidable
On the Diophantine problem related to power circuits
-
Unbounded Łukasiewicz satisfiability reduces to NP-complete MV-algebra case
Satisfiability in {\L}ukasiewicz logic and its unbounded relative
-
Type theory models localize to elementary ∞-toposes
Elementary $\infty$-toposes from type theory
-
Collapse forcings match arbitrary ones for projective absoluteness
Terminal Absoluteness of Collapse Forcings
-
Implicit operations are partial functions preserved by homomorphisms
The theory of implicit operations
-
CH classifies all projection masas in the Calkin algebra
On masas of the Calkin algebra generated by projections
-
Ternary relations turn affordances into logical objects
Towards a logic of affordances
-
Some module classes under pure embeddings are unstable
On the problem of stability of abstract elementary classes of modules
-
Negative translation proves undecidability for intuitionistic grammar logics
Nested Sequents for Intuitionistic Multi-Modal Logics: Modularity, Cut-Elimination, and Undecidability
-
Step-duplicating recursor evades all twelve standard direct measures
The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
-
Barrier theorem places step-duplicating recursors outside direct measures
The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
-
Soluble ranked Lie rings contain Cartan subrings
Cartan subrings in soluble ranked Lie rings
-
Hall's Harem Theorem realized by unary functions with cycle controls
Hall's Harem Theorem with controlled sizes of cycles
-
Subdivision yields finite countermodels for modal logics
Chopping More Finely: Finite Countermodels in Modal Logic via the Subdivision Construction
-
¬CH implies non-isomorphic ultrapowers of equivalent C*-algebras
On the isomorphism problem for ultraproducts of $\mathrm{C}^*$-algebras in continuous model theory
-
Neighborhood models complete predicate modal logics with ω-rules
Neighborhood and algebraic models for predicate modal logics with $\omega$-rules
-
Bishop inequality gives uniform rates for random real convergence
Bishop's (up)crossing inequality and lower semicomputable random reals revisited
-
Epimorphism among countable groups is complete analytic quasi-order
The epimorphism relation among countable groups is a complete analytic quasi-order
-
First cohomology vanishes for definable nilpotents with trivial invariants
On the cohomology of finite-dimensional nilpotent groups and Lie rings
-
Goodstein theorem generalizes to Π¹₁-CA₀
Generalizing Goodstein's theorem and Cichon's independence proof
-
Semantic explosion principles defined via unsatisfiability in models
Generalized Explosion Principles: A Semantic Perspective
-
Compactness at ω₂ leaves Suslin hypothesis undecided
Compactness for small cardinals in mathematics: principles, consequences, and limitations
-
Trees built so their powers differ in normality or Souslinness
The power of trees
-
Non-Nikodym generated algebras also lack Grothendieck property
The Nikodym and Grothendieck properties of Boolean algebras and rings related to ideals
-
First-order definability of Campana and Darmon points in function fields
First-order definability of Campana Points and Darmon Points in algebraic function fields in one variable over number fields
-
Isomorphism on bi-orderable groups is weakly universal
The isomorphism problem for finitely generated bi-orderable groups
-
Nonemptiness atom keeps satisfiability NP-complete
Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
-
New logic system models compacta and the pseudo-arc
Cologic of Closed Covers of Compacta and the Pseudo-Arc
-
Cubic equations encode proof checking at each fixed resource level
Considering The Satisfiability of Cubic Diophantine Equations
-
No algorithm decides finite orbits for polynomial maps on integer tuples
Undecidability of Finite Orbit Recognition in Polynomial Maps
-
Gain-graphic matroids are not definable for non-locally finite groups
Myhill-Nerode for hypergraphs and an application to gain-graphic matroids
-
Sp-homogeneous orderings are always relatively Δ4 categorical
sp-Homogeneous Linear Orderings
-
Surreal automorphism group decomposes into five factors
Decomposing the automorphism group of the surreal numbers
-
Large cardinals yield model with no scale at aleph_omega
Combinatorics in Higher Solovay Models
-
Carryless map pairs numbers via disjoint Fibonacci bands
Carryless Pairing: Additive Pairing in the Fibonacci Basis
-
Bound of (2r+1)^{2^{k-1}-1} on progressing moves in splitter games
A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
-
Approximate logic preserves stability and simplicity
On Approximate Classification of Theories
-
Tractable temporal and phylogeny languages admit 4-ary pseudo-Siggers polymorphisms
When Darwin met Ianus: dichotomies of expressivity
-
Ordinal cardinality needs ZFC-independent call counts
Reduction Complexities in Set Theory
-
No locally universal von Neumann algebra has a computable presentation
The Universal Theory of Locally Universal Tracial von Neumann Algebras is not Computable
-
Priestley duality now covers fuzzy spaces and positive MV-algebras
An extension of Priestley duality to fuzzy topologies and positive MV-algebras
-
Prover-adversary games characterize eLDT and eLNDT
Prover-Adversary games for systems over (non-deterministic) branching programs
-
Computable pair colorings force every pattern-avoiding set to compute DNC relative to 0'
Ramsey-like theorems and immunities
-
k-automatic sets split into two definability classes in Presburger arithmetic
A Dichotomy for $k$-automatic expansions of Presburger Arithmetic
-
ZFC+GCH model has stationary non-approachable points at every such δ⁺
Total Failure of Approachability at Successors of Singulars of Countable Cofinality
-
Derivatives preserve constructible functions
The Derivative of a Constructible Function is Constructible