Related papers: Iterated Priority Arguments in Descriptive Set The…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
We develop a theory of k-partitions of the set of infinite words recognizable by classes of finite automata. The theory enables to complete proofs of existing results about topological classifications of the (aperiodic) omega-regular…
The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…
In this paper, we first establish decay estimates for the fractional and higher-order fractional H\'enon-Lane-Emden systems by using a nonlocal average and integral estimates, which deduce a result of non-existence. Next, we apply the…
The representation theory (idempotents, quivers, Cartan invariants and Loewy series) of the higher order unital peak algebras is investigated. On the way, we obtain new interpretations and generating functions for the idempotents of descent…
This paper is a continuation of previous work of the author. We use the categorical trace formalism to give a construction of the categorical Jordan decomposition for representations of finite groups of Lie type. As a second application, we…
This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…
We describe a variation of Ash's $\eta$-system, and give a new proof of Ash's metatheorem. As an application, we prove a generalization of Ash and Knight's theorem on pairs of structures.
We investigate the completeness of intuitionistic logic with respect to Prawitz's proof-theoretic validity. As an intuitionistic natural deduction system, we apply atomic second-order intuitionistic propositional logic. By developing phase…
We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level $\omega_1$ (that is, the ones that are closed under Borel preimages) and iteratively applying the operations…
In this paper we apply the method of Lagrangian descriptors to explore the geometrical structures in phase space that govern the dynamics of dissipative systems. We demonstrate through many classical examples taken from the nonlinear…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
Most of the engineering and physical systems are generally characterized by differential and difference equations based on their continuous-time and discrete-time dynamics, respectively. Moreover, these dynamical models are analyzed using…
This contribution presents two exponential stability criteria for linear systems with multiple pointwise and distributed delays. These results (necessary and sufficient conditions) are given in terms of the delay Lyapunov matrix and the…
In this work we introduce a category $LDP_d$ of discrete-time dynamical systems, that we call discrete Lagrange--D'Alembert--Poincar\'e systems, and study some of its elementary properties. Examples of objects of $LDP_d$ are nonholonomic…
Solutions to differential equations, which are used to model physical systems, are computed numerically by solving a set of discretized equations. This set of discretized equations is reduced to a large linear system, whose solution is…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…
The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In…
In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a…
Our paper illustrates how the theory of Lie systems allows recovering known results and provide new examples of piecewise deterministic processes with phase-type jumps for which the corresponding first-time passage problems may be solved…