×

Found 996 Documents (Results 201–300)

Mathematical foundations for computer science. Sets, logic, recursion. (Mathematische Grundlagen für die Informatik. Mengen, Logik, Rekursion.) (German) Zbl 1291.68003

Springer-Lehrbuch. Wiesbaden: Springer Vieweg (ISBN 978-3-658-03078-0/pbk; 978-3-658-03079-7/ebook). x, 222 p. (2013).
PDFBibTeX XMLCite
Full Text: DOI

Proofs and computations. (English) Zbl 1294.03006

Perspectives in Logic. Cambridge: Cambridge University Press; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 978-0-521-51769-0/hbk; 978-1-139-03190-5/ebook). xiii, 465 p. (2012).
PDFBibTeX XMLCite
Full Text: DOI

Function symbols in ASP: overview and perspectives. (English) Zbl 1259.68183

Brewka, Gerhard (ed.) et al., Nonmonotonic reasoning. Essays celebrating its 30th anniversary. Papers from the conference (NonMon30), Lexington, KY, USA, October 22–25, 2010. London: College Publications (ISBN 978-1-84890-042-4/pbk). Studies in Logic (London) 31, 1-24 (2011).
MSC:  68T27 68N17 68-02
PDFBibTeX XMLCite

Fixed point theory in ordered sets and applications. From differential and integral equations to game theory. (English) Zbl 1209.47001

New York, NY: Springer (ISBN 978-1-4419-7584-3/hbk; 978-1-4419-7585-0/ebook). xiv, 477 p. (2011).
PDFBibTeX XMLCite
Full Text: DOI

Semi-recursive nonparametric identification in the general sense of a nonlinear heteroscedastic autoregression. (English. Russian original) Zbl 1211.93132

Autom. Remote Control 71, No. 2, 257-274 (2010); translation from Avtom. Telemekh. 2010, No. 2, 92-111 (2010).
MSC:  93E15 93E03 93C10
PDFBibTeX XMLCite
Full Text: DOI

Recursive set constructions and iterated function systems. Separation conditions and dimension. (English) Zbl 1211.28001

Report. University of Jyväskylä. Department of Mathematics and Statistics 126. Jyväskylä: University of Jyväskylä, Department of Mathematics and Statistics (Diss.) (ISBN 978-951-39-3927-4/pbk). iv, 18, 95 p., not consecutively paged. (2010).
Reviewer: Su Weiyi (Nanjing)
MSC:  28-02 28A80 37F99
PDFBibTeX XMLCite
Full Text: Link

Uniqueness, continuity, and existence of implicit functions in constructive analysis. (English) Zbl 1247.03131

Bauer, Andrej (ed.) et al., 6th international conference on computability and complexity in analysis (CCA’09). Proceedings of the international conference, August 18–22, 2009, Ljubljana, Slovenia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-12-5). OASIcs – OpenAccess Series in Informatics 11, 10 p., electronic only (2009).
MSC:  03F60
PDFBibTeX XMLCite
Full Text: DOI

Relativization of real numbers to a universe. (English) Zbl 1167.03039

Lindström, Sten (ed.) et al., Logicism, intuitionism, and formalism. What has become of them? Originated from the conference and the symposium on constructive mathematics, Uppsala, Sweden, August 2004. Dordrecht: Springer (ISBN 978-1-4020-8925-1/hbk; 978-1-4020-8926-8/e-book). Synthese Library 341, 189-207 (2009).
MSC:  03F60
PDFBibTeX XMLCite
Full Text: DOI

Write it recursively: a generic framework for optimal path queries. (English) Zbl 1323.68422

Proceedings of the 13th ACM SIGPLAN international conference on functional programming, ICFP ’08, Victoria, BC, Canada, September 20–28, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-919-7). ACM SIGPLAN Notices 43, No. 9, 169-178 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Computable Riesz representation for locally compact Hausdorff spaces. (English) Zbl 1262.03140

Dilhage, R. (ed.) et al., Proceedings of the fourth international conference on computability and complexity in analysis (CCA 2007), Siena, Italy, June 16–18, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 202, 3-12 (2008).
MSC:  03F60 28C05 47B38
PDFBibTeX XMLCite
Full Text: DOI

Integral of two-dimensional Fine-computable functions. (English) Zbl 1262.03143

Brattka, V. (ed.) et al., Proceedings of the fifth international conference on computability and complexity in analysis (CCA 2008), Hagen, Germany, August 21–24, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 221, 141-152 (2008).
MSC:  03F60 03D78 26B15
PDFBibTeX XMLCite
Full Text: DOI

Phase transitions for weakly increasing sequences. (English) Zbl 1143.03020

Beckmann, Arnold (ed.) et al., Logic and theory of algorithms. 4th conference on computability in Europe, CiE 2008, Athens, Greece, June 15–20, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69405-2/pbk). Lecture Notes in Computer Science 5028, 168-174 (2008).
MSC:  03D15 03D20
PDFBibTeX XMLCite
Full Text: DOI

Computable Riesz representation for the dual of \(C[0;1]\). (English) Zbl 1262.03141

Cenzer, D. (ed.) et al., Proceedings of the 3rd international conference on computability and complexity in analysis (CCA 2006), Gainesville, FL, USA, November 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 167, 157-177 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Computability and the implicit function theorem. (English) Zbl 1262.03142

Cenzer, D. (ed.) et al., Proceedings of the 3rd international conference on computability and complexity in analysis (CCA 2006), Gainesville, FL, USA, November 1–5, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 167, 3-15 (2007).
MSC:  03F60 26B10 58C15
PDFBibTeX XMLCite
Full Text: DOI

Embedding in finitely presented lattice-ordered groups: explicit presentation for constructions. (English) Zbl 1125.06013

Campbell, C.M. (ed.) et al., Groups St. Andrews 2005. Vol. II. Selected papers of the conference, St. Andrews, UK, July 30–August 6, 2005. Cambridge: Cambridge University Press (ISBN 978-0-521-69470-4/pbk). London Mathematical Society Lecture Note Series 340, 438-444 (2007).
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software