Related papers: Lewisian Fixed Points I: Two Incomparable Construc…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
The SO(32) theory, in the limit where it is an open superstring theory, is completely specified in the light-cone gauge as a second-quantized string theory in terms of a ``matrix string'' model. The theory is defined by the neighbourhood of…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…
We prove a fixed point theorem for the action of certain local monodromy groups on \'etale covers and use it to deduce lower bounds in essential dimension. In particular, we give more geometric proofs of many (but not all) of the results of…
We prove some constructive results that on first and maybe even on second glance seem impossible.
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…
We introduce an alternative approach for constrained mathematical programming problems. It rests on two main aspects: an efficient way to compute optimal solutions for unconstrained problems, and multipliers regarded as variables for a…
The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…
The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…
Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and…
V. Lunts has recently established Lefschetz fixed point theorems for Fourier-Mukai functors and dg algebras. In the same vein, D. Shklyarov introduced the noncommutative analogue of the Hirzebruch-Riemann-Roch theorem. In this short…
By suitable examples we illustrate an algorithm for composition of inverse problems.
In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlier work that obtains Hennessy-Milner theorems as corollaries…
This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…