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

We define functionals generalising the Seiberg-Witten functional on closed $spin^c$ manifolds, involving higher order derivatives of the curvature form and spinor field. We then consider their associated gradient flows and, using a gauge…

We present a unified categorical framework that connects the syntactic Henkin construction for the first-order Completeness Theorem with Lawvere's Fixed-Point Theorem. Concretely, we define two canonical functors from the category of…

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

In this chapter of the book entitled, "Extending the Theory of Composites to Other Areas of Science" [edited by Graeme W. Milton, 2016] we give a rigorous derivation of the field equation recursion method in the abstract theory of…

The problem of determining whether or not any program terminates was shown to be undecidable by Turing, but recent advances in the area have allowed this information to be determined for a large class of programs. The classic method for…

Using a result of M. Hochster and C. Huneke on $F$-rational rings a criterion for complete intersection rings of characteristic $p>0$ is presented. As an application, we give a completely different proof for an algebraic result of G.…

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

We present a new theoretical framework that unifies category-theoretic fixed-point constructions, transfinite recursion, and game-based semantics to model how interpretations of language can stabilize through unlimited self-reference. By…

An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, called schematic CERES, can be used to analyze these proofs,…

Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite…

We prove a result concerning formality of the pull-back of a fibration. Our approach is to use bar complexes in the category of commutative differential graded algebras. As an application, we generalize an old result of Baum and Smith.

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…

We show that variants of the classical reflection functors from quiver representation theory exist in any abstract stable homotopy theory, making them available for example over arbitrary ground rings, for quasi-coherent modules on schemes,…

We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…

Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…

We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the…

Regular model checking is a well-established technique for the verification of regular transition systems (RTS): transition systems whose initial configurations and transition relation can be effectively encoded as regular languages. In…

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

The Riesz-Kantorovich formula expresses (under certain assumptions) the supremum of two operators $S, T : X \to Y$ where $X$ and $Y$ are ordered linear spaces as $$ S \vee T (x) = \sup_{0 \leqslant y \leqslant x} [S (y) + T (x - y)]. $$ We…

This paper provides an overview of Lawvere's Fixed-Point Theorem in category theory and aims to detail the universal framework underlying self-reference and recursive structures. First, we rigorously define fundamental concepts - such as…