Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Barendregt H"'
Autor:
Barendregt, H. P., Terwijn, S. A.
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the numbering
Externí odkaz:
http://arxiv.org/abs/1910.07750
Autor:
Barendregt, H. P., Terwijn, S. A.
In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete numbering. We discuss various generalizations of this result. Among other things, we show that Arslanov's completeness criterion also
Externí odkaz:
http://arxiv.org/abs/1809.06233
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Fitting, M.; Rayman, B. (ed.), Raymond Smullyan on Self-reference, pp. 67-111
Outstanding Contributions to Logic, 67-111. Cham : Springer
STARTPAGE=67;ENDPAGE=111;TITLE=Outstanding Contributions to Logic
Raymond Smullyan on Self Reference ISBN: 9783319687315
Outstanding Contributions to Logic, 67-111. Cham : Springer
STARTPAGE=67;ENDPAGE=111;TITLE=Outstanding Contributions to Logic
Raymond Smullyan on Self Reference ISBN: 9783319687315
In this birdwatching paper our binoculars are focused upon a particular bird from Smullyan’s enchanted forest of combinatory birds (Smullyan in To Mock a Mockingbird, and other logic puzzles. Alfred A. Knopf, New York, 1985), to wit the Starling. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12352deca456914f56d6e68781a22cd0
https://hdl.handle.net/2066/199860
https://hdl.handle.net/2066/199860
Autor:
Barendregt, H.
Publikováno v:
Studies in Spirituality, 26, pp. 15-32
Studies in Spirituality, 26, 15-32
Studies in Spirituality, 26, 15-32
Contains fulltext : 163207.pdf (Publisher’s version ) (Open Access)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ebe13cba1c1ead0ec6a569ca85f1ac50
https://hdl.handle.net/2066/163207
https://hdl.handle.net/2066/163207
Publikováno v:
Akkerhuis, G.A.J.M. Jagers op (ed.), Evolution and Transitions in Complexity: The Science of Hierarchical Organization in Nature, 61-64. Cham : Springer International Publishing
STARTPAGE=61;ENDPAGE=64;TITLE=Akkerhuis, G.A.J.M. Jagers op (ed.), Evolution and Transitions in Complexity: The Science of Hierarchical Organization in Nature
Akkerhuis, G.A.J.M. Jagers op (ed.), Evolution and Transitions in Complexity: The Science of Hierarchical Organization in Nature, pp. 61-64
Evolution and Transitions in Complexity ISBN: 9783319438016
STARTPAGE=61;ENDPAGE=64;TITLE=Akkerhuis, G.A.J.M. Jagers op (ed.), Evolution and Transitions in Complexity: The Science of Hierarchical Organization in Nature
Akkerhuis, G.A.J.M. Jagers op (ed.), Evolution and Transitions in Complexity: The Science of Hierarchical Organization in Nature, pp. 61-64
Evolution and Transitions in Complexity ISBN: 9783319438016
This review offers a short summary of the Operator Theory, or O-theory, including the notion of closure consisting of some circular processes. Based on closure, the Operator Theory distinguishes a limited number of levels in the organization of natur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4249ec1742bfed2bdffbe8f1bbcc649a
http://hdl.handle.net/2066/161421
http://hdl.handle.net/2066/161421
Publikováno v:
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, pp. 128-143
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, 128-143. Dagstuhl : Schloss Dagstuhl
STARTPAGE=128;ENDPAGE=143;ISSN=1868-8969;TITLE=Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic
Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic, 128-143. Dagstuhl : Schloss Dagstuhl
STARTPAGE=128;ENDPAGE=143;ISSN=1868-8969;TITLE=Kreutzer, S. (ed.), CSL 2015 : 24th EACSL Annual Conference on Computer Science Logic
Automata theoretical techniques are developed that handle inhabitant search in the simply typed lambda calculus. The automata-theoretic model for inhabitant search, which can be viewed as proof search by the Curry-Howard isomorphism, is proven to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b36d570cabccc9906ea16860ab6bb59
https://hdl.handle.net/2066/147299
https://hdl.handle.net/2066/147299