{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:08Z","timestamp":1725600308370},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_30","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"315-326","source":"Crossref","is-referenced-by-count":5,"title":["Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable"],"prefix":"10.1007","author":[{"given":"Peter","family":"Franek","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Ratschan","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Zgliczynski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"205","key":"30_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/S0025-5718-1994-1203731-4","volume":"62","author":"O. Aberth","year":"1994","unstructured":"Aberth, O.: Computation of topological degree using interval arithmetic, and applications. Mathematics of Computation\u00a062(205), 171\u2013178 (1994)","journal-title":"Mathematics of Computation"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/0885-064X(86)90022-1","volume":"2","author":"T.E. Boult","year":"1986","unstructured":"Boult, T.E., Sikorski, K.: Complexity of computing topological degree of lipschitz functions in n dimensions. J. Complexity\u00a02, 44\u201359 (1986)","journal-title":"J. Complexity"},{"volume-title":"Quantifer Elimination and Cylindrical Algebraic Decomposition","year":"1998","key":"30_CR3","unstructured":"Caviness, B.F., Johnson, J.R. (eds.): Quantifer Elimination and Cylindrical Algebraic Decomposition. Springer, Heidelberg (1998)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.entcs.2008.12.005","volume":"221","author":"P. Collins","year":"2008","unstructured":"Collins, P.: Computability and representations of the zero set. Electron. Notes Theor. Comput. Sci.\u00a0221, 37\u201343 (2008)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1142\/S0129054107004577","volume":"18","author":"W. Damm","year":"2007","unstructured":"Damm, W., Pinto, G., Ratschan, S.: Guaranteed termination in the verification of LTL properties of non-linear robust discrete time hybrid systems. International Journal of Foundations of Computer Science (IJFCS)\u00a018(1), 63\u201386 (2007)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"30_CR6","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511960.001.0001","volume-title":"Degree Theory in Analysis and Applications","author":"I. Fonseca","year":"1995","unstructured":"Fonseca, I., Gangbo, W.: Degree Theory in Analysis and Applications. Clarendon Press, Oxford (1995)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-48168-0_10","volume-title":"Computer Science Logic","author":"M. Fr\u00e4nzle","year":"1999","unstructured":"Fr\u00e4nzle, M.: Analysis of hybrid systems: An ounce of realism can save an infinity of states. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 126\u2013140. Springer, Heidelberg (1999)"},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1137\/S0036142903438148","volume":"43","author":"A. Frommer","year":"2005","unstructured":"Frommer, A., Lang, B.: Existence tests for solutions of nonlinear equations using Borsuk\u2019s theorem. SIAM Journal on Numerical Analysis\u00a043(3), 1348\u20131361 (2005)","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"30_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9449-5","volume-title":"Differential topology","author":"M. Hirsch","year":"1976","unstructured":"Hirsch, M.: Differential topology. Springer, Heidelberg (1976)"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/S0036142999361074","volume":"38","author":"R. Kearfott","year":"2000","unstructured":"Kearfott, R., Dian, J., Neumaier, A.: Existence verification for singular zeros of complex nonlinear systems. SIAM J. Numer. Anal.\u00a038(2), 360\u2013379 (2000)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"30_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1016381031155","volume":"8","author":"R.B. Kearfott","year":"2002","unstructured":"Kearfott, R.B.: On existence and uniqueness verification for non-smooth functions. Reliable Computing\u00a08(4), 267\u2013282 (2002)","journal-title":"Reliable Computing"},{"key":"30_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-8134-0","volume-title":"A Primer of Real Analytic Functions","author":"S. Krantz","year":"2002","unstructured":"Krantz, S., Parks, H.R.: A Primer of Real Analytic Functions. Birkh\u00e4user, Basel (2002)"},{"key":"30_CR13","volume-title":"Topology from the Differential Viewpoint","author":"J.W. Milnor","year":"1997","unstructured":"Milnor, J.W.: Topology from the Differential Viewpoint. Princeton Univ. Press, Princeton (1997)"},{"key":"30_CR14","volume-title":"Topology","author":"J. Munkres","year":"1999","unstructured":"Munkres, J.: Topology. Prentice Hall, Englewood Cliffs (1999)"},{"key":"30_CR15","volume-title":"Interval Methods for Systems of Equations","author":"A. Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge (1990)"},{"key":"30_CR16","volume-title":"Topological Degree Theory and Applications","author":"D. O\u2019Regan","year":"2006","unstructured":"O\u2019Regan, D., Cho, Y., Chen, Y.Q.: Topological Degree Theory and Applications. Chapman & Hall, Boca Raton (2006)"},{"issue":"4","key":"30_CR17","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1006\/jsco.2001.0519","volume":"33","author":"S. Ratschan","year":"2002","unstructured":"Ratschan, S.: Quantified constraints under perturbations. Journal of Symbolic Computation\u00a033(4), 493\u2013505 (2002)","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"30_CR18","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/1183278.1183282","volume":"7","author":"S. Ratschan","year":"2006","unstructured":"Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic\u00a07(4), 723\u2013748 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-13562-0_36","volume-title":"Theory and Applications of Models of Computation","author":"S. Ratschan","year":"2010","unstructured":"Ratschan, S.: Safety verification of non-linear hybrid systems is quasi-semidecidable. In: Kratochv\u00edl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol.\u00a06108, pp. 397\u2013408. Springer, Heidelberg (2010)"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1023\/A:1024419816707","volume":"4","author":"S.M. Rump","year":"1998","unstructured":"Rump, S.M.: A note on epsilon-inflation. Reliable Computing\u00a04, 371\u2013375 (1998)","journal-title":"Reliable Computing"},{"key":"30_CR21","unstructured":"Sergeraert, F.: Introduction to combinatorial homotopy theory. In: Summer School and Conference Mathematics, Algorithms and Proofs, Lecture notes (2008), http:\/\/www-fourier.ujf-grenoble.fr\/~sergerar\/Papers\/Trieste-LectureNotes.pdf"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01419526","volume":"25","author":"F. Stenger","year":"1975","unstructured":"Stenger, F.: Computing the topological degree of a mapping in R n . Numerische Mathematik\u00a025, 23\u201338 (1975)","journal-title":"Numerische Mathematik"},{"key":"30_CR23","doi-asserted-by":"crossref","DOI":"10.1525\/9780520348097","volume-title":"A Decision Method for Elementary Algebra and Geometry","author":"A. Tarski","year":"1951","unstructured":"Tarski, A.: A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley (1951) (also in [3])"},{"key":"30_CR24","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Introduction to Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Introduction to Computable Analysis. Texts in Theoretical Computer Science. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T20:13:49Z","timestamp":1712693629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}