Toward the interpretation of non-constructive reasoning as non-monotonic learning-Reference-Cited by-同舟云学术

Toward the interpretation of non-constructive reasoning as non-monotonic learning

Published:2009-01 Issue:1 Volume:207 Page:63-81
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Berardi Stefano,de’Liguoro Ugo

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference28 articles.

1. Games and full completeness for multiplicative linear logic;Abramsky;Journal of Symbolic Logic,1994

2. Full abstraction for PCF;Abramsky;Information and Computation,2000

3. Inductive inference of formal languages from positive data;Angluin;Information and Control,1980

4. F. Barbanera, S. Berardi, M. Schivalocchi, “classical” programming-with-proofs in lambdapasym: an analysis of non-confluence, in: TACS, Lecture Notes in Computer Science, vol. 1281, 1997, pp. 365–390.

5. S. Berardi, Retraction-free limits of learning sequences are Δ11-complete, draft version, April 23, 2007 Torino. Available from: .

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language;Logical Methods in Computer Science;2024-01-26

2. GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION;The Journal of Symbolic Logic;2017-06

3. Non-monotonic Pre-fix Points and Learning;Fundamenta Informaticae;2017-03-03

4. Knowledge Spaces and the Completeness of Learning Strategies;Logical Methods in Computer Science;2014-02-12

5. Non-monotonic Pre-fixed Points and Learning;Electronic Proceedings in Theoretical Computer Science;2013-08-28