相关论文: A Direct Proof of Schwichtenberg's Bar Recursion C…

In two papers we noted that in common practice many algebraic constructions are defined only `up to isomorphism' rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper…

We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs, or the subterm criterion. We show that the derivational…

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their…

Mechanistic interpretability often identifies circuits inside Transformer models, but explanations of those circuits are usually validated through examples, ablations, and manual reasoning. This leaves a gap between finding a plausible…

This essay aims to propose construction theory, a new domain of theoretical research on machine construction, and use it to shed light on a fundamental relationship between living and computational systems. Specifically, we argue that…

The Stabbing Planes proof system was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formulas --…

In previous work, the second author introduced a topology, for spaces of irreducible representations, that reduces to the classical Zariski topology over commutative rings but provides a proper refinement in various noncommutative settings.…

Let $T$ be a bounded quaternionic normal operator on a right quaternionic Hilbert space $\mathcal{H}$. We show that $T$ can be factorized in a strongly irreducible sense, that is, for any $\delta >0$ there exist a compact operator $K$ with…

A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…

We introduce two notions of a contractive orbit of a set-valued map defined in a first countable space. The first defines the contraction with respect to the topology of the underlying space while the second defines the contraction with…

This paper is concerned with discrete, one-dimensional Schr\"odinger operators with real analytic potentials and one Diophantine frequency. Using localization and duality we show that almost every point in the spectrum admits a…

The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable…

The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…

For a scheme X, denote by SH(X_et^hyp) the stabilization of the hypercompletion of its etale infty-topos, and by SH_et(X) the localization of the stable motivic homotopy category SH(X) at the (desuspensions of) etale hypercovers. For a…

In ASPIC-style structured argumentation an argument can rebut another argument by attacking its conclusion. Two ways of formalizing rebuttal have been proposed: In restricted rebuttal, the attacked conclusion must have been arrived at with…

Towards better understanding of gate elimination, the only method known that can prove complexity lower bounds for explicit functions against unrestricted Boolean circuits, this work contributes: (1) formalizing circuit simplifications as a…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order…