English
Related papers

Related papers: Degrees of incomputability, realizability and cons…

200 papers

In a previous paper it was shown that the Forward Euler method applied to differential inclusions where the right-hand side is a Lipschitz continuous set-valued function with uniformly bounded, compact values, converges with rate one. The…

Numerical Analysis · Mathematics 2009-02-02 Mattias Sandberg

Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…

Logic in Computer Science · Computer Science 2011-12-01 Samson Abramsky

The solvability for infinite dimensional differential algebraic equations possessing a resolvent index and a Weierstra{\ss} form is studied. In particular, the concept of integrated semigroups is used to determine a subset on which…

Analysis of PDEs · Mathematics 2024-07-16 Mehmet Erbay , Birgit Jacob , Kirsten Morris

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Logic · Mathematics 2024-11-26 Gunter Fuchs , Kaethe Minden

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

Logic · Mathematics 2010-03-26 Guido Gherardi , Alberto Marcone

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…

Logic · Mathematics 2016-09-14 Bernard A. Anderson , Barbara F. Csima

We introduce the concept of inverse powerset by adding three axioms to the Zermelo-Fraenkel set theory. This extends the Zermelo-Fraenkel set theory with a new type of set which is motivated by an intuitive meaning and interesting…

Logic · Mathematics 2012-05-17 Patrick St-Amant

Given a finite connected bipartite graph, finite-dimensional indecomposable semisimple Leibniz algebras are constructed. Furthermore, any finite-dimensional indecomposable semisimple Leibniz algebra admits a similar construction.

Rings and Algebras · Mathematics 2019-08-06 Rustam Turdibaev

This paper begins the study of infinite-dimensional modules defined on bicomplex numbers. It generalizes a number of results obtained with finite-dimensional bicomplex modules. The central concept introduced is the one of a bicomplex…

Functional Analysis · Mathematics 2011-08-10 Raphael Gervais Lavoie , Louis Marchildon , Dominic Rochon

In considering the reliability of numerical programs, it is normal to "limit our study to the semantics dealing with numerical precision" (Martel, 2005). On the other hand, there is a great deal of work on the reliability of programs that…

Symbolic Computation · Computer Science 2014-04-25 James H. Davenport , Russell Bradford , Matthew England , David Wilson

Given some set, how hard is it to construct a measure supported by it? We classify some variations of this task in the Weihrauch lattice. Particular attention is paid to Frostman measures on sets with positive Hausdorff dimension. As a side…

Logic in Computer Science · Computer Science 2014-09-12 Arno Pauly , Willem L. Fouché

We obtain complete classification of in-equivalent realizations of the Virasoro algebra by Lie vector fields over the three-dimensional field of real numbers. As an application we construct new classes of nonlinear second-order partial…

Exactly Solvable and Integrable Systems · Physics 2013-10-11 Renat Zhdanov , Qing Huang

In this paper, we introduce the commutativity degree of a finite-dimensional Lie algebra over a finite field and determine upper and lower bounds for it. Moreover, we study some relations between the notion of commutativity degree and known…

Algebraic Geometry · Mathematics 2024-06-17 Afsaneh Shamsaki , Ahmad Erfanian , Mohsen Parvizi

Given an o-minimal structure expanding the field of reals, we show a piecewise Weierstrass preparation theorem and a piecewise Weierstrass division theorem for definable holomorphic functions. In the semialgebraic setting and for the…

Complex Variables · Mathematics 2016-10-13 Tobias Kaiser

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…

Computational Complexity · Computer Science 2025-03-04 Marcus Schaefer , Daniel Stefankovic

We survey methods and results of fractional differential equations in which an unknown function is under the operation of integration and/or differentiation of fractional order. As an illustrative example, we review results on fractional…

Analysis of PDEs · Mathematics 2018-11-12 Moulay Rchid Sidi Ammi , Delfim F. M. Torres

Integro-differential sweeping processes with prox-regular sets in Hilbert spaces have been the subject of various recent studies. Diverse applications of such differential inclusions to complementarity problems, electrical circuits,…

Optimization and Control · Mathematics 2024-07-24 Tahar Haddad , Sarra Gaouir , Lionel Thibault

There are several relations which may fall short of genuine identity, but which behave like identity in important respects. Such grades of discrimination have recently been the subject of much philosophical and technical discussion. This…

Logic · Mathematics 2017-10-18 Tim Button

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…

Computational Complexity · Computer Science 2012-06-04 Emmanuel Jeandel , Pascal Vanier

We study the equational theory of the Weihrauch lattice with composition and iterations, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the composition operator $\star$ and…

Logic in Computer Science · Computer Science 2025-01-30 Cécilia Pradic