Deciding linear-transcendental problems

MaRDI QIDQ2702031zbMATH OpenFDO

Authors Volker Weispfenning

Publication date 31 October 2001

zbMATH Keywords

decision procedurefirst-order theorylinear differential systemslinear-transcendental problemsreachabilitytranscendental functions

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Exponential and trigonometric functions (33B10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Deciding polynomial-transcendental problems
• Deciding linear-trigonometric problems
• Deciding polynomial-exponential problems
• Satisfiability modulo transcendental functions via incremental linearization
• On recurrent reachability for continuous linear dynamical systems

Cited in

(6)

• Deciding linear-trigonometric problems
• On recurrent reachability for continuous linear dynamical systems
• Algorithmic global criteria for excluding oscillations
• Symbolic reachability computation for families of linear vector fields
• Decision problem for a class of univariate Pfaffian functions
• Deciding polynomial-transcendental problems

This page was built for publication: Deciding linear-transcendental problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2702031)