Related papers: A Friedman--Sheard-style Theory for Classical Real…

The Schrodinger equation for non-relativistic quantum systems is derived from some classical physics axioms within an ensemble hamiltonian framework. Such an approach enables one to understand the structure of the equation, in particular…

We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic.

Given a single (differential-algebraic) input-output equation, we present a method for finding different representations of the associated system in the form of rational realizations; these are dynamical systems with rational right-hand…

The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…

For a Riemann integrable function on an interval and for a point therein,we define 'Fourier series at the point on the interval' and bring out how and when the function element becomes expressible as Fourier series.In this process,we also…

The polynomial hierarchy has been widely studied in classical complexity theory. In this paper, we will generalize some commonly known results about the polynomial hierarchy to a version of the hierarchy extended to promise problems. This…

We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.

Jarnik's identity plays a major role in classical simultaneous approximation to two real numbers. O. German [2] has shown a generalization to the weighted setting in which the identity has to be replaced by two inequalities. His methods…

Real-world phenomena can often be conveniently described by dynamical systems (that is, ODE systems in the state-space form). However, if one observes the state of the system only partially, the observed quantities (outputs) and the inputs…

We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot's lambda-mu-calculus to represent proofs of…

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time…

On the basis of the first principle -- the law of probability conservation and the Helmholtz decomposition theorem the authors have succeeded to construct the Schr\"odinger, Pauli, Dirac equation, the Hamilton-Jacobi equation and the…

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

In this paper, we prove well-posedness in $C^1(\mathbb{R})$ (a.k.a. classical solutions) of the Fornberg-Whitham equation. To achieve this objective, we study its weak formulation under a Lagrangian framework. Applying the fundamental…

The concept of determinism for a classical system is interpreted as the requirement that the solution to the Cauchy problem for the equations of motion governing this system be unique. This requirement is generally assumed to hold for all…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

We investigate the analogues of certain classical estimates of Littlewood for the Riemann zeta-function in the context of quadratic Dirichlet $L$-functions over function fields. In some situations, we are actually able to establish finer…

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…