archive
Every paper Pith has read. Search by title, abstract, or pith.
407 papers in math.LO · page 3
-
Free-set and rainbow theorems extend to barriers
Free sets, thin sets and rainbows for barriers
-
Set theory model yields graph on reals beyond countable projective functions
Locally countable graphs of second projective class not generated by countably many projective functions
-
Model yields Π¹₂ equivalence relation without projective generators
Locally countable graphs of second projective class not generated by countably many projective functions
-
Model of set theory yields Π¹₂ graph not generated by projective functions
Locally countable graphs of second projective class not generated by countably many projective functions
-
Model yields Π¹₂ equivalence relation not generated by projective functions
Locally countable graphs 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
-
Ecumenical systems preserve Glivenko's logic translations
Glivenko's theorems from an ecumenical perspective
-
Lean 4 counter-model blocks Spinoza Prop V even with substantive PSR
Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
-
Lean counter-models refute full PSR-reducibility of Spinoza Prop V
Bennett's Conjecture in Lean 4: Counter-Models for the PSR-Reducibility of Spinoza's Propositions V and XIV
-
EML expressions yield only computable reals
Inexpressibility in Exp-Minus-Log
-
Why this fact holds instead of that one in DL
Rethinking Explanations: Formalizing Contrast in Description Logics
-
Categorical univalence does not imply function extensionality
Univalence without function extensionality
-
Categoricity in one nonzero arithmetic degree implies it in all
Categoricity without Power
-
Lexicographic orders on ^α2 classified for countable partition arrows
Infinite-Exponent Partition Relations on Higher Analogues of the Real Line
-
Intuitionistic common knowledge gets complete cyclic calculi
Intuitionistic Common Knowledge
-
Non-standard analysis extends transcendence criteria via infinite primes
Notes on Algebraic Properties and Non-Standard Analysis of the Ring of Integers Modulo Infinitely Large Primes
-
Primitive recursive selector verifies every consistency instance for strong theories
Uniformity of Consistency in Arithmetic and G\"odel's Second Incompleteness Theorem: Ein M\"archen
-
Abstention restricts guaranteed coverage to avoid hallucinations
Hallucination, abstention, and computable inseparability
-
Abstention restricts safe answer domains in formal systems
Hallucination, abstention, and computable inseparability
-
Coalition Logic gains explicit inability as negated ability
A Logic of Inability
-
VC-density in group pairs bounded by twice the parameter count
VC-Density in Divisible Oriented Abelian Groups and Their Pairs
-
Consistency implications may control simulations in arithmetic theories
Toward a Characterization of Simulation Between Arithmetic Theories
-
Computable étale spaces match maps into overt-discrete spaces
A note on computable \'{e}tale spaces
-
Hilbert inner product needs exp(1/ε) samples for stability
A note on quantitative stability in Hilbert spaces
-
Ramsey property eliminates maximal almost disjoint families
Ramsey Property and Pathological Sets: Almost Disjointness, Independence and Other Maximal Objects
-
Necessary conditions govern Pfaffian solutions of algebraic ODEs
Special classes of functions
-
Formulas in F_q((Q)) reduce to one existential polynomial equation
Elimination results for tame fields with finite residue fields
-
Three DGA equivalence problems shown to be undecidable
Undecidability problems for semifree DG algebras
-
Finite Kripke models embed into arithmetic via provability predicates
Finite Kripke models and provability interpretations in quantified modal logic
-
S^1_2 stays consistent with EXP not in P/poly
From G\"odel incompleteness to the consistency of circuit lower bounds
-
Inferential omega-rule gives arithmetic a unique model
Carnapian Frameworks and Categoricity of Arithmetic via Inferential $\omega$-logics
-
Monads unify classical, fuzzy and probabilistic semantics in ULLER
NeSyCat: A Monad-Based Categorical Semantics of the Neurosymbolic ULLER Framework
-
NTP2 expansions preserve constructibility of definable sets
NTP2 topological structures
-
Almost free algebras make isomorphism polynomial-time decidable
Almost free algebras: from the word problem to elimination of quantifiers
-
Closed Ramsey numbers for ω·n+1 lie between ω^4 and ω^5
On closed Ramsey numbers of small countable ordinals
-
Games match Kripke semantics for constructive mu-calculus
The Constructive $\mu$-calculus: Game Semantics and Non-Wellfounded Proof Systems
-
Multiple topologies give complete semantics for intuitionistic modal logics
Polytopological Semantics for Intuitionistic Modal Logics
-
Craig interpolation proven for the six open extensions of S4
Interpolation above S4
-
Definable well-order equates projective and ordinary chromatic numbers
Projective Chromatic Numbers
-
Restricted class logics match large cardinals
Model theory of class-sized logics
-
Stone dualities link modal frames to spaces with binary relations
Topological Dualities for Modal Algebras
-
Fraïssé structure has universal automorphism group without extensible age
An unusual example of a universal automorphism group
-
Generic automorphisms of stable groups are supertight
On generic and supertight automorphisms
-
Corrections to auxiliary propositions preserve main motivic theorems
Corrigendum to `Evaluation of motivic functions, non-nullity, and integrability in fibers', Advances in Mathematics, Vol. 409, Part A, Paper No. 108635, 29 pages, doi:10.1016/j.aim.2022.108635 (2022)
-
Model separates boldface Σ¹₃ uniformization from lightface Σ¹₄
On $\boldsymbol{\Sigma}^1_3$- and $\Sigma^1_4$-uniformization
-
QLETF+ is sound and complete for six-valued semantics
Positive, Negative, and Reliable Information in a First-Order Logic of Evidence and Truth
-
Reachability rules capture domain conditions in nested sequents for modal logics
Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules