Related papers: Ordinal Notation
We provide direct elementary proofs of several explicit expressions for Bernoulli numbers and Bernoulli polynomials. As a byproduct of our method of proof, we provide natural definitions for generalized Bernoulli numbers and polynomials of…
This paper deals with stability of a certain class of fractional order linear and nonlinear systems. The stability is investigated in the time domain and the frequency domain. The general stability conditions and several illustrative…
I have argued elsewhere that second order logic provides a foundation for mathematics much in the same way as set theory does, despite the fact that the former is second order and the latter first order, but second order logic is marred by…
We describe a mathematical structure that can give extensional denotational semantics to higher-order probabilistic programs. It is not limited to discrete probabilities, and it is compatible with integration in a way the models that have…
This the first of a series of articles dealing with abstract classification theory. The apparatus to assign systems of cardinal invariants to models of a first order theory (or determine its impossibility) is developed in [Sh:a]. It is…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
In this work we discuss a new type of factorisation systems for \textbf{Ord}-enriched categories. We start by defining the new notion of lax weak orthogonality, which involves the existence of lax diagonal morphisms for lax squares. Using…
An algebraic tree T is one determined by a finite system of fixed point equations. The frontier \Fr(T) of an algebraic tree t is linearly ordered by the lexicographic order \lex. When (\Fr(T),\lex) is well-ordered, its order type is an…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
How to measure the degree of uncertainty of a given frame of discernment has been a hot topic for years. A lot of meaningful works have provided some effective methods to measure the degree properly. However, a crucial factor, sequence of…
We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
We define a notion of a weak canonical base for a partial type. This notion is weaker than the usual canonical base for an amalgamation base. We prove that certain family of partial types have a weak canonical base. This family clearly…
Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…
In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed…
This paper grew out of the observation that the possibilities of proof by induction and definition by recursion are often confused. The paper reviews the distinctions. The von Neumann construction of the ordinal numbers includes a…
In this paper, we start by giving the definitions and basic facts about hyperoctahedral number system. There is a natural correspondence between the integers expressed in the latter and the elements of the hyperoctahedral group when we use…
We introduce a variation on Barthe et al.'s higher-order logic in which formulas are interpreted as predicates over open rather than closed objects. This way, concepts which have an intrinsically functional nature, like continuity,…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…