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

We propose an operationally-based deductive proof method for program equivalence. It is based on encoding the language semantics as logically constrained term rewriting systems (LCTRSs) and the two programs as terms. The main feature of our…

We consider branes in refined topological strings. We argue that their wave-functions satisfy a Schr\"odinger equation depending on multiple times and prove this in the case where the topological string has a dual matrix model description.…

By reformulating the classical proof as a Baire Category argument, we show that Besicovitch's Theorem in Cantor space is provable in $ACA_0$, and additionally that the witnessing subset is computable from one jump of the original set. We…

The Dependent Object Types (DOT) calculus incorporates concepts from functional languages (e.g. modules) with traditional object-oriented features (e.g. objects, subtyping) to achieve greater expressivity (e.g. F-bounded polymorphism).…

Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often…

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in…

This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion…

Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…

Ulrich Berger presented a powerful proof of strong normalisation using domains, in particular it simplifies significantly Tait's proof of strong normalisation of Spector's bar recursion. The main contribution of this paper is to show that,…

Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape $\exists x_1 \dotsc \exists x_k \forall y\,\phi$…

A number of papers deal with the problem of counting the number of retractions of a structure $S$ onto a substructure $T.$ In the particular case when $S$ is a free algebra, this number is $\geq 1$ iff $T$ is projective. In this paper we…

We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let $\Sigma$ be a language consisting of function symbols (representing type constructors) and $C$ a decidable structure in the relational…

Finite rank perturbations $T=N+K$ of a bounded normal operator $N$ on a separable Hilbert space are studied thanks to a natural functional model of $T$; in its turn the functional model solely relies on a perturbation matrix/ characteristic…

Complex free-energy landscapes with many local minima separated by large barriers are believed to underlie glassy behavior across diverse physical systems. This is the heuristic picture associated with replica symmetry breaking (RSB) in…

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

We present a sequent calculus for abstract focussing, equipped with proof-terms: in the tradition of Zeilberger's work, logical connectives and their introduction rules are left as a parameter of the system, which collapses the synchronous…

We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…

In this article, we give a full description of a topological many-one degree structure of real-valued functions, recently introduced by Day-Downey-Westrick. We also point out that their characterization of the Bourgain rank of a Baire-one…

Let $A$ be an Artinian local ring with algebraically closed residue field $k$, and let $\mathbf{G}$ be an affine smooth group scheme over $A$. The Greenberg functor $\mathcal{F}$ associates to $\mathbf{G}$ a linear algebraic group…

A local Tb Theorem provides a flexible framework for proving the boundedness of a Calder\'on-Zygmund operator T. One needs only boundedness of the operator T on systems of locally pseudo-accretive functions \{b_Q\}, indexed by cubes. We…