Deciding polynomial-transcendental problems
نویسندگان
چکیده
منابع مشابه
Deciding polynomial-transcendental problems
This paper presents a decision procedure for a certain class of sentences of first order logic involving integral polynomials and a certain specific analytic transcendental function trans(x) in which the variables range over the real numbers. The list of transcendental functions to which our decision method directly applies includes exp(x), the exponential function with respect to base e, ln(x)...
متن کاملDeciding Reachability for Planar Multi-polynomial Systems
In this paper we investigate the decidability of the reach-ability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a nite number of (polyhedral) regions. To each of these regions is assigned some vector eld which governs the dynamical behaviour of the system within t...
متن کاملInvariance And Inner Fractals In Polynomial And Transcendental Fractals
A lot of formal and informal recreational study took place in the fields of Meromorphic Maps, since Mandelbrot popularized the map z ← z + c. An immediate generalization of the Mandelbrot z ← z + c also known as the Multibrot family were also studied. In the current paper, general truncated polynomial maps of the form z ← ∑ p≥2 apx p + c are studied. Two fundamental properties of these polynomi...
متن کاملDeciding the Undecidable: Wrestling with Hilbert’s Problems
In the year 1900, the German mathematician David Hilbert gave a dramatic address in Paris, at the meeting of the 2nd International Congress of Mathematicians—an address which was to have lasting fame and importance. Hilbert was at that point a rapidly rising star, if not superstar, in mathematics, and before long he was to be ranked with Henri Poincaré as one of the two greatest and most influe...
متن کاملDeciding Isomorphisms of Simple Types in Polynomial Time
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and terminal objects are well studied these models are exactly the Cartesian closed categories. Isomorphism of two simple types in such a model is decidable by reduction to a normal form and comparison under a nite number of permutations (Bruce, Di Cosmo, and Longo 1992). Unfortunately, these normal forms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2012
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.08.004