Related papers: An Interpretation of E-HA$^w$ inside HA$^w$
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We construct bases for the spaces of higher order modular forms of all orders and weights. We also provide a cohomological interpretation of these forms.
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which…
The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems. This logic includes a form of hypothetical judgment that leads to dynamically changing sets of assumptions and that is key to…
We develop a proof-theoretic semantics (P-tS) for second-order logic (S-oL), providing an inferentialist alternative to both full and Henkin model-theoretic interpretations. Our approach is grounded in base-extension semantics (B-eS), a…
The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…
We study higher rank Jacobi partial and false theta functions (generalizations of the classical partial and false theta functions) associated to positive definite rational lattices. In particular, we focus our attention on certain Kostant's…
We discuss partial specifications in first-order logic FO and also in a Turing-complete extension of FO. We compare the compositional and game-theoretic approaches to the systems.
We describe a Martin-L\"of-style dependent type theory, called Cocon, that allows us to mix the intensional function space that is used to represent higher-order abstract syntax (HOAS) trees with the extensional function space that…
We define analogues of Verma modules for finite W-algebras. By the usual ideas of highest weight theory, this is a first step towards the classification of finite dimensional irreducible modules. Motivated by known results in type A, we…
Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…
The computer-mechanization of an ambitious explicit ethical theory, Gewirth's Principle of Generic Consistency, is used to showcase an approach for representing and reasoning with ethical theories exhibiting complex logical features like…
Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a…
We present a higher well-ordering principle which is equivalent (over Simpson's set theoretic version of $\text{ATR}_0$) to the existence of transitive models of Kripke-Platek set theory, and thus to $\Pi^1_1$-comprehension. This is a…
We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18]. The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude…
The new notion of operator/matrix $k$-tone functions is introduced, which is a higher order extension of operator/matrix monotone and convex functions. Differential properties of matrix $k$-tone functions are shown. Characterizations,…
Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…
We provide a Lawvere-style definition for partial theories, extending the classical notion of equational theory by allowing partially defined operations. As in the classical case, our definition is syntactic: we use an appropriate class of…
We develop a simplified method for obtaining higher orders in the perturbative expansion of the singular term A(\alpha_s)/[1-x]_+ of non-singlet partonic splitting functions. Our method is based on the calculation of eikonal diagrams. The…