Satisfiability of Systems of Equations of Real Analytic Functions is Quasi-decidable

0368130 - ÚI 2012 RIV DE eng C - Conference Paper (international conference)
Franek, Peter - Ratschan, Stefan - Zgliczynski, P.
Satisfiability of Systems of Equations of Real Analytic Functions is Quasi-decidable.
Mathematical Foundations of Computer Science 2011. Berlin: Springer, 2011 - (Murlak, F.; Sankowski, P.), s. 315-326. Lecture Notes in Computer Science, 6907. ISBN 978-3-642-22992-3. ISSN 0302-9743.
[MFCS 2011. International Symposium /36./. Warsaw (PL), 22.08.2011-26.08.2011]
R&D Projects: GA MŠMT OC10048
Institutional research plan: CEZ:AV0Z10300504
Keywords : decidability * logical theories * real numbers
Subject RIV: IN - Informatics, Computer Science
Permanent Link: http://hdl.handle.net/11104/0202562