English
Related papers

Related papers: A General Verification for Functional Completeness…

200 papers

We give an example of a convex, finite and lower semicontinuous function whose subdifferential is everywhere empty. This is possible since the function is defined on an incomplete normed space. The function serves as a universal…

Optimization and Control · Mathematics 2024-09-30 Gerd Wachsmuth

The functional interpretation is a systematic, syntactic method for transforming certain non-constructive proofs into constructive proofs with explicit bounds. We illustrate the interpretation by working through a concrete, fairly simple…

Logic · Mathematics 2015-03-20 Henry Towsner

Let $\mathcal{E}$ denote the space of entire functions with the topology of uniform convergence on compact sets. The action of $\mathbb C$ by translations on $\mathcal E$ is defined by $T_zf(w) = f(w+z)$. Let $\mathcal{U}$ denote the set of…

Dynamical Systems · Mathematics 2025-07-18 Adi Glücksam , Benjamin Weiss

Vertex operator realizations of symplectic and orthogonal Schur functions are studied and expanded. New proofs of determinant identities of irreducible characters for the symplectic and orthogonal groups are given. We also give a new proof…

Quantum Algebra · Mathematics 2015-09-16 Naihuan Jing , Benzhi Nie

For engineering software with formal correctness proofs it is crucial that proofs can be efficiently reused in case the software or its specification is changed. Unfortunately, in reality even slight changes in the code or its specification…

Software Engineering · Computer Science 2015-01-20 Maria Pelevina

Formal verification tools are often developed by experts for experts; as a result, their usability by programmers with little formal methods experience may be severely limited. In this paper, we discuss this general phenomenon with…

Software Engineering · Computer Science 2015-08-20 Carlo A. Furia , Christopher M. Poskitt , Julian Tschannen

It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined…

Programming Languages · Computer Science 2007-05-23 Patricia M. Hill , Roberto Bagnara , Enea Zaffanella

We show the completeness of the system of generalized eigenfunctions of closed extensions of elliptic cone operators under suitable conditions on the symbols.

Spectral Theory · Mathematics 2010-04-06 Thomas Krainer

For Hilbert, the consistency of a formal theory T is an infinite series of statements "D is free of contradictions" for each derivation D and a consistency proof is i) an operation that, given D, yields a proof that D is free of…

Logic · Mathematics 2024-03-20 Sergei Artemov

Let $(X, \{w_j \}_{j=1}^m, \{p_j \}_{j=1}^m)$ ($2 \leq m < \infty$) be a contractive iterated function system (IFS), where $X$ is a compact subset of ${\Bbb{R}}^d$. It is well known that there exists a unique nonempty compact set $K$ such…

Dynamical Systems · Mathematics 2009-04-08 Xiao-Peng Chen , Li-Yan Wu , Yuan-Ling Ye

The quest for complete observables in general relativity has been a longstanding open problem. We employ methods from descriptive set theory to show that no complete observable on rich enough collections of spacetimes is Borel definable. In…

General Relativity and Quantum Cosmology · Physics 2023-10-24 Aristotelis Panagiotopoulos , George Sparling , Marios Christodoulou

It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators,…

Computational Complexity · Computer Science 2008-12-18 Edith Hemaspaandra , Henning Schnoor , Ilka Schnoor

Composition technologies improve reuse in the development of large-scale complex systems. Safety critical systems require intensive validation and verification activities. These activities should be compositional in order to reduce the…

Software Engineering · Computer Science 2014-04-04 Mounira Kezadri Hamiaz , Marc Pantel , Benoît Combemale , Xavier Thirioux

We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…

Classical Analysis and ODEs · Mathematics 2009-11-11 Luis Daniel Abreu

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

Formal Languages and Automata Theory · Computer Science 2011-07-28 Jeffrey Shallit

In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].

Complex Variables · Mathematics 2015-07-31 Abdallah El Farissi , Zinelâabidine Latreuch , Benharrat Belaïdi , Asim Asiri

Consider a finite dimensional complex Hilbert space $\cH$, with $dim(\cH) \geq 3$, define $\bS(\cH):= \{x\in \cH \:|\: ||x||=1\}$, and let $\nu_\cH$ be the unique regular Borel positive measure invariant under the action of the unitary…

Mathematical Physics · Physics 2017-08-23 Valter Moretti , Davide Pastorello

The safety of automated driving systems must be justified by convincing arguments and supported by compelling evidence to persuade certification agencies, regulatory entities, and the general public to allow the systems on public roads.…

Software Engineering · Computer Science 2024-10-28 Jonas Krook , Yuvaraj Selvaraj , Wolfgang Ahrendt , Martin Fabian

In this paper, we characterize absolute norm-attainability for compact hyponormal operators. We give necessary and sufficient conditions for a bounded linear compact hyponormal operator on an infinite dimensional complex Hilbert space to be…

Functional Analysis · Mathematics 2019-03-29 Benard Okelo

A topologized semilattice $X$ is called complete if each non-empty chain $C\subset X$ has $\inf C$ and $\sup C$ that belong to the closure $C$ of the chain $C$ in $X$. In this paper, we introduce various concepts of completeness of…

Rings and Algebras · Mathematics 2021-08-19 Konstantin Kazachenko , Alexander V. Osipov
‹ Prev 1 8 9 10 Next ›