Unifying logic, topology and learning in parametric logic

DOI10.1016/j.tcs.2005.10.018zbMath1086.68066OpenAlexW2041565209MaRDI QIDQ817837

Frank Stephan, Arun Sharma, Eric Martin

Publication date: 20 March 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.018

zbMATH Keywords

inductive logicinductive inferenceBorel and difference hierarchiesweak forms of compactness

Mathematics Subject Classification ID

Computational learning theory (68Q32) Descriptive set theory (03E15) Abstract deductive systems (03B22)

Related Items

Learning algebraic structures with the help of Borel equivalence relations ⋮ Topological Properties of Concept Spaces ⋮ Realism, rhetoric, and reliability ⋮ Topological properties of concept spaces (full version) ⋮ Nonmonotonicity in the framework of parametric logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary formal systems, intrinsic complexity, and procrastination
• Classification using information
• Classical recursion theory. Vol. II
• On the role of procrastination in machine learning
• Topology and descriptive set theory
• Foundations of inductive logic programming
• On one-sided versus two-sided classification
• Ordinal mind change complexity of language identification
• Inductive inference of formal languages from positive data
• Language identification in the limit