archive
Every paper Pith has read. Search by title, abstract, or pith.
574 papers in math.LO · page 1
-
Theory-topos duality defines conceptual completeness for logic fragments
Conceptual completeness for subgeometric logics
-
Homeomorphism groups of pseudo-solenoids have non-metrizable minimal flows
Universal minimal flows of the homeomorphism groups of pseudo-solenoids are non-metrizable
-
Hennessy-Milner theorem equivalent to ACA0 over RCA0
Bisimulations in second-order arithmetic
-
Lean verifies Rogers-Ramanujan identities
Formalized $q$-series: The Rogers-Ramanujan Identities and Beyond
-
Polish group homomorphisms to residually finite groups have open kernels
Homomorphisms from topological groups to inverse limits
-
Minimal frames make injectivity definable in modal-temporal logic
Definability of Functional Properties in the Basic Modal-Temporal Language over Ordered Frames
-
Δ-spaces and Q-spaces match measurable cardinal strength
New results about Q and $\Delta$-spaces
-
Lindenbaum-algebras prove some inequalities have no integer solutions
A generalization of a representation of the integers modulo $p$, for the purpose of occasionally establishing the unsolvability of diophantine inequalities
-
Z^2 shift graph has continuous oriented chromatic number 7
The continuous oriented chromatic number of directed Schreier graphs of $\mathbb Z^2$-shift actions
-
Halo operator equals ω-accumulation points on every space
Halo Semantics for Modal Logic
-
Translations map relevant logics into normal modal logics
Possibly Relevant Translations
-
Intuitionistic K matches the bisimulation-invariant fragment of intuitionistic FOL
Intuitionistic K is a Bisimulation-Invariant Fragment of Intuitionistic First-Order Logic
-
All additive normal formulas classified in K
On Interpretations of Normal Modal Logics
-
Calculus for intuitionistic monotone modal logic proves decidability
Intuitionistic Monotone Modal Logic: Proof Theory and Semantics
-
Quasivarieties with infinite irreducibles lack strong structural completeness
On Strong Structural Completeness of Varieties and Quasivarieties
-
Modal measurable logics complete via Loomis-Sikorski extension
Modal Measurable Logics via a Modal Loomis-Sikorski Representation Theorem
-
iEx-logic extensions form product of intermediate and orthomodular lattices
Conditionals and Modalities in Constructive Quantum Logics
-
Dynamic bit precision boosts FPGA CNN energy efficiency 82%
MINT: Dynamic-Precision CNN Inference with MSDF Digit-Serial Arithmetic on FPGA
-
PSL(2,R) discrete subgroups are concretely classifiable
Classification of Fuchsian groups with torsion
-
PSL_2(R) action on discrete subgroups is concretely classifiable
Classification of Fuchsian groups with torsion
-
Prelinearity transfers consistency results to non-involutive algebras
Recovery operators in quasi-Nelson logic: the prelinear case
-
Generic free subgroups of Urysohn isometries satisfy NSS
Generic dense free subgroups of the isometry group of the Urysohn space are NSS
-
ReLU nets approximate traceable sets at rate O(ε^{-p(n-1)/m})
Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks
-
Finite big Ramsey degrees of Henson graphs are provable in ACA0'
The finite big Ramsey degrees of Henson graphs are provable in $\mathrm{ACA}_0$
-
Lean 4 formalizes Scott's 1972 continuous lattices
A Lean 4 Formalization of Scott's \emph{Continuous Lattices} (1972)
-
Reflexive Nelson algebras admit independent equational axiomatization
An independent equational basis for the variety of reflexive Nelson algebras
-
Rejection sets validate weak-negation axioms in modal CLoN
Modal Extensions of CLoN with Bi-neighborhood Semantics
-
Modal translations embed fundamental logic fully into orthologic and intuitionistic varian
Fundamental Logic Through the Lens of Modality
-
Theories cannot prove existence of their own ω-models
On some generalizations of G\"{o}del's second incompleteness theorem
-
Equalizers defined uniformly from differential polynomial coefficients
Definable Eventual Equalizers
-
RC consistent with d=ω₁, cov(N)=ω₂, non(N)=ω₁ at 2^ω=ω₂
Rado's Conjecture and the random algebra
-
Two stable relations compose to order property in simple theory
The Failure of Stable Composition for Equivalence Relations in Simple Theories
-
Nonexistence of 3-ladders at ℵ₂ matches Mahlo consistency
A solution to Ditor's problem
5 Piths -
NSOP_r defined for all real r >= 2
Some applications of the real strict order property hierarchy
-
Hyper Boolean algebras characterize several LFIs via swap structures
Hyper Swap Structures: The Case Study of LFIs and Hyper Boolean Algebras
-
Quotients by maximal ideals give differentially closed fields
A natural haystack of differentially closed fields
-
Embeddings reveal axiom of choice through declining anomaly scores
Geometric Measurements of the Axiom of Choice in Neural Proof Embeddings
-
Uniform categoricity bounds fix Scott ranks of finite trees at 2m+1
Scott complexity of trees of finite rank via degrees of categoricity
-
New axioms characterize the Solovay model
Independence relations in the Solovay model II
-
ε_α ordinals up to ω^{ω^ω} are quadratically closed nimber fields
Some quadratically closed fields of nimbers
-
No finite axioms capture measurable majorities
Measurable Majorities Are Not Finitely Axiomatizable
-
Transfinite bar-recursion keeps cardinals up to kappa intact
Bar-recursion and Preservation of Cardinals
-
Generalized bar-recursion preserves cardinals up to kappa
Bar-recursion and Preservation of Cardinals
-
Ramsey ideals gain partition and convergence characterizations
Combinatorics of Ramsey ideals
-
Part-whole principle links to ded κ via Dedekind cuts
A note on $\text{ded }\kappa$ and the part-whole principle
-
Priestley duality links precontact conditions to first-order dual properties
Priestley Representation of Distributive Precontact Lattices
-
Finite fields admit fixed-parameter tractable first-order model checking
Model checking in finite fields and finite groups
-
Finite fields admit tractable first-order model checking
Model checking in finite fields and finite groups
-
No-algebraicity actions force all mixed identities to be singular
All mixed identities are singular in groups with no algebraicity
-
Turing model shows feedback computation equals Kleene recursion in ²E
A Turing machine model for Kleene Type 2 recursion