Zobrazeno 1 - 10
of 34
pro vyhledávání: '"S. S. Wainer"'
Autor:
F. R. Drake, S. S. Wainer
Recursion theory – now a well-established branch of pure mathematics, having grown rapidly over the last 35 years – deals with the general (abstract) theory of those operations which we conceive as being `computable'by idealized machines. The the
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and met
Autor:
Sieg, S. S. Wainer
"A 'linear-style' sequent calculus makes it possible to explore the close structural relationships between primitive recursive programs and their inductive termination proofs, and between program transformations and their corresponding proof transfor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8ca6bf63742287bd1d55d36598ab311
Publikováno v:
Logic Colloquium '01: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Vienna, Austria, August 6-11, 2001
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54b15f1b09b1f023aba87ed5f9c058bb
https://doi.org/10.1017/9781316755860.020
https://doi.org/10.1017/9781316755860.020
Publikováno v:
Computability, Enumerability, Unsolvability. :333-347
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bcb3caa2501432f1b0bf89aa82bef88
https://doi.org/10.1017/cbo9780511629167.017
https://doi.org/10.1017/cbo9780511629167.017
Publikováno v:
Automata, Languages and Programming ISBN: 3540528261
ICALP
ICALP
We work in the context of abstract data types, modelled as classes of many-sorted algebras. We develop notions of computability over such data types, in particular notions of primitive recursiveness and μ-recursiveness, which generalize the correspo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c977ecbbe880a640be4231fcc8dfff7c
https://doi.org/10.1007/bfb0032065
https://doi.org/10.1007/bfb0032065
Autor:
S. S. WAINER
Publikováno v:
Logic Colloquium '01 ISBN: 9780367807085
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a125b71fa77c70f3d8cac0de27da592
https://doi.org/10.1201/9781439865736-19
https://doi.org/10.1201/9781439865736-19
Autor:
G. E. Ostrin, S. S. Wainer
Publikováno v:
Proof and System-Reliability ISBN: 9781402006081
A weak formal theory of arithmetic is developed, entirely analogous to classical arithmetic but with two separate kinds of variables: induction variables and quantifier variables. The point is that the provably recursive functions are now more feasib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29baf8ed893f010c9fdc7211be7e67e9
https://doi.org/10.1007/978-94-010-0413-8_12
https://doi.org/10.1007/978-94-010-0413-8_12
Autor:
W. G. Handley, S. S. Wainer
Publikováno v:
Computational Logic ISBN: 9783642636707
Primitive recursion is the fundamental example of “recursive definition”. It is intimately related with “for-loops” in programming, and with the E1induction rule in proof theory. Though the primitive recursive functions contain many fast-grow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28b5f9ed1f3ceba332efc59414199151
https://doi.org/10.1007/978-3-642-58622-4_8
https://doi.org/10.1007/978-3-642-58622-4_8
Publikováno v:
Computability, Enumerability, Unsolvability: Directions in recursion theory
The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and met
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::683e5c56f7dadec9db1b6cf91e67448e
https://doi.org/10.1017/cbo9780511629167
https://doi.org/10.1017/cbo9780511629167