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

DOI10.1016/j.ic.2008.10.003zbMath1169.68022OpenAlexW1974193572MaRDI QIDQ1004290

Stefano Berardi, Ugo de'Liguoro

Publication date: 2 March 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.10.003

zbMATH Keywords

game theorylearning theoryproof theorylogic

Mathematics Subject Classification ID

Computational learning theory (68Q32) Applications of game theory (91A80) Applications of computability and recursion theory (03D80) Complexity of proofs (03F20)

Related Items (3)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language ⋮ Games with 1-backtracking ⋮ GAME SEMANTICS AND THE GEOMETRY OF BACKTRACKING: A NEW COMPLEXITY ANALYSIS OF INTERACTION

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games with 1-backtracking
• Mathematics based on incremental learning -- excluded middle and inductive inference
• A game semantics for linear logic
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Some intuitionistic equivalents of classical principles for degree 2 formulas
• Inductive inference of formal languages from positive data
• Iterated Limiting Recursion and the Program Minimization Problem
• Toward a mathematical theory of inductive inference
• Games and full completeness for multiplicative linear logic
• A semantics of evidence for classical arithmetic
• Automata, Languages and Programming
• Limiting recursion
• Language identification in the limit

This page was built for publication: Toward the interpretation of non-constructive reasoning as non-monotonic learning